4
4
4.0 Slide 4.1 4.2
HEURISTIC SEARCH
4.3 4.4 4.5 4.6 Using Heuristics in Games Complexity Issues Epilogue and References Exercises
Introduction An Algorithm for Heuristic Search Admissibility, Monotonicity, and Informedness
Figure 4.1: First three levels of the tic-tac-toe state space reduced by
Slide 4
symmetry.
A R T I F I C I A L I N T E L L I G E N C E: Structure and Strategies for Complex Problem Solving, 4th Edition George F. Luger
2002 Addison Wesley
Figure 4.2: The "most wins" heuristic applied to the first children in tic-tac-toe.
Slide 4
A R T I F I C I A L I N T E L L I G E N C E: Structure and Strategies for Complex Problem Solving, 4th Edition George F. Luger
2002 Addison Wesley
Figure 4.3: Heuristically reduced state space for tic-tac-toe.
Slide 4
A R T I F I C I A L I N T E L L I G E N C E: Structure and Strategies for Complex Problem Solving, 4th Edition George F. Luger
2002 Addison Wesley
Slide 4
function best_first_search algorithm
A R T I F I C I A L I N T E L L I G E N C E: Structure and Strategies for Complex Problem Solving, 4th Edition George F. Luger
2002 Addison Wesley
Figure 4.4: Heuristic search of a hypothetical state space.
Slide 4
A R T I F I C I A L I N T E L L I G E N C E: Structure and for Strategies Complex Problem Solving, 4th Edition George F. Luger
2002 Addison Wesley
A trace of the execution of best_first_search for Figure 4.4
Slide 4
A R T I F I C I A L I N T E L L I G E N C E: Structure and Strategies for Complex Problem Solving, 4th Edition George F. Luger
2002 Addison Wesley
Figure 4.5: Heuristic search of a hypothetical state space with open and
Slide 4
closed states highlighted.
A R T I F I C I A L I N T E L L I G E N C E: Structure and Strategies for Complex Problem Solving, 4th Edition George F. Luger
2002 Addison Wesley
Figure 4.6: The start state, first set of moves, and goal state for an 8-puzzle
Slide 4
instance.
A R T I F I C I A L I N T E L L I G E N C E: Structure and Strategies for Complex Problem ...