Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::IDAStarDomain Concept Reference

Minimal contract for IDA* domains. More...

#include <State_Search_IDA_Star.H>

Concept definition

template<typename Domain>
Concept for domains that provide the cost of applying a move.
Minimal contract for DFS/backtracking domains.
Concept for domains that provide an admissible heuristic.
Minimal contract for IDA* domains.
and
Check uniqueness with explicit hash + equality functors.

Detailed Description

Minimal contract for IDA* domains.

Extends Aleph::BacktrackingDomain with:

  • heuristic(state) — admissible cost estimate to the nearest goal,
  • cost(state, move) — non-negative step cost.

Both must expose a Distance type (numeric, typically int or double). The heuristic must be admissible (never overestimates the true cost) for IDA* to return an optimal solution.

Definition at line 74 of file State_Search_IDA_Star.H.