Enforced Hill-climbing (cont) The success of this strategy depends on how informative the heuristic is FF uses a heuristic found to be informative in a large class of bench mark planning domains The strategy is not complete Never backtracking means that some parts of the search space are lost If FF fails to find a solution using this strategy it switches to standard best-first search (e. g, Greedy or A* search) Outline Introduction to ff FF Search Algorithm FF Heuristic Fn FF Example AppendiX: HSPEnforced Hill-Climbing (cont.) ƒ The success of this strategy depends on how informative the heuristic is. ƒ FF uses a heuristic found to be informative in a large class of bench mark planning domains. ƒ The strategy is not complete. ƒ Never backtracking means that some parts of the search space are lost. ƒ If FF fails to find a solution using this strategy it switches to standard best-first search. ƒ (e. g., Greedy or A* search). Outline ƒ Introduction to FF ƒ FF Search Algorithm ƒ FF Heuristic Fn ƒ FF Example ƒ Appendix: HSP