![]() |
mutable
A Database System for Research and Fast Prototyping
|
This heuristic estimates the distance from a state to the nearest goal state as the product of the sizes of all Subproblems yet to be joined.
More...
#include <HeuristicSearchPlanEnumerator.hpp>
This heuristic estimates the distance from a state to the nearest goal state as the product of the sizes of all Subproblems yet to be joined.
This heuristic is not admissible and dramatically overestimates the actual distance to a goal state. Serves as a starting point for development of other heuristics that try to estimate the cost by making the margin of error for the overestimation smaller.
Definition at line 1889 of file HeuristicSearchPlanEnumerator.hpp.