|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Minimal contract for IDA* domains. More...
#include <State_Search_IDA_Star.H>
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.