concepts.algorithm.search.heuristic_search

Generic implementation of A* search.

Functions

backtrace_plan(node, nr_expansions)	Backtrace the plan from the goal node.
run_heuristic_search(initial_state, ...[, ...])	A generic implementation for heuristic search.

Classes

QueueNode	A node object in the queue, containing the priority and the search node.
SearchNode	A node object corresponding to the current search state, containing the state, the parent node, the last action, the cost, and the depth.