IDAStar

Declared in astar/IDAStar.h; the same class on the site of Doxygen.

template<Domain D>
class IDAStar

the iterative-deepening A* search of a Domain

The counters of the Solution are summed over the iterations: expanded counts every expansion, those of the states already expanded in an earlier iteration included, and stored is the length of the longest path held, i.e., the memory of the search in states. The node_limit of the SearchOptions bounds the expansions, and the search stops with Status::node_limit when it reaches it; expected_nodes is not used.

Public Types

using State = state_t<D>

the state type

using Cost = cost_t<D>

the cost type

using SolutionT = Solution<State, Cost>

the solution type

Public Functions

inline explicit IDAStar(const D &domain, const SearchOptions &options = {})

constructor, taking the Domain (which must outlive the IDAStar)

inline SolutionT solve(void) const

searches the Domain, returning the Solution