|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Minimal requirement for search moves. More...
#include <state_search_common.H>
Minimal requirement for search moves.
Moves are stored in Aleph arrays (SearchPath) to preserve a reconstruction path and to support move-ordering policies, so they must be ArrayStorable; they are also appended and copied by value (path.append(move), path snapshots), so they must be copyable, assignment included.
Definition at line 99 of file state_search_common.H.