Overview | Group | Tree | Graph | Index | Concepts |
This function creates and returns a node evaluator that implements a best first search.
Nodes are evaluated according to the variable var
. As long as the minimum of var
is no greater than the minimum of the evaluation of each open nodes + step
, the search continues
as a depth-first search. If the opposite is true, the goal manager postpones the evaluation of the current
node and jumps to the best open node.
See Also: