- Admissible heuristic functions (lower bounds) guarantee
optimal solutions.
- Admissible heuristic functions have larger error
(than arbitrary functions) and thus cause inefficient searches.
- Penalty patterns are an indication of difficulties
with the current situation.
- Use the pattern knowledge to avoid "sticky" situations.
- Postpone these "sticky" positions to later iterations of IDA*.
- Since patterns are continously added and dropped,
the decision to postpone is dynamic.
|
|
