DDDAStar

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

template<DiskDomain D>
class DDDAStar

the A* search of a Domain with delayed duplicate detection on the disk

The counters of the Solution: expanded counts the states expanded, each once, generated the successors, duplicates the copies dropped (within a file and against the closed files), and stored the states written to the closed files, i.e., the distinct states expanded. The node_limit of the SearchOptions bounds stored, 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 DDDAStar(const D &domain, const SearchOptions &options = {}, DDDOptions ddd = {})

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

inline SolutionT solve(void) const

searches the Domain, returning the Solution