Additive Pattern Database Heuristics
Additive Pattern Database Heuristics
Additive Pattern Database Heuristics
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
1. Introduction and Overview●●Heuristic search: A*, IDA*...A heuristic evaluation function h(n)=an estimateof the cost of an optimal solution from node n toa goal state●If h(n) is admissible, meaning that it neveroverestimates the cost of reaching a goal, then allthe above algorithms are guaranteed to return anoptimal solution, if one exists.