public class


extends DepthFirstSearch<A, S, N extends Node<A, S, N>>
   ↳ es.usc.citius.hipster.algorithm.Algorithm<A, S, N extends es.usc.citius.hipster.model.Node<A, S, N>>
     ↳ es.usc.citius.hipster.algorithm.DepthFirstSearch<A, S, N extends es.usc.citius.hipster.model.Node<A, S, N>>
       ↳ es.usc.citius.hipster.algorithm.IDAStar<A, S, C extends java.lang.Comparable<C>, N extends es.usc.citius.hipster.model.HeuristicNode<A, S, C, N>>

Class Overview

Implementation of the IDA* algorithm. Similar to Iterative DFS but using heuristics to limit the space search and keeping a very low memory usage.

Original paper: Richard E. Korf "Depth-first Iterative-Deepening: An Optimal Admissible Tree Search.", Artificial Intelligence, vol. 27, pp. 97-109, 1985.


Nested Classes
class IDAStar.Iterator IDA iterator. 
Inherited Fields
From class es.usc.citius.hipster.algorithm.DepthFirstSearch
Public Constructors
IDAStar(N initialNode, NodeExpander<A, S, N> expander)
Public Methods
Iterator iterator()
Inherited Methods
From class es.usc.citius.hipster.algorithm.DepthFirstSearch
From class es.usc.citius.hipster.algorithm.Algorithm
From class java.lang.Object
From interface java.lang.Iterable

Public Constructors

public IDAStar (N initialNode, NodeExpander<A, S, N> expander)

Public Methods

public Iterator iterator ()