Search Methods

Abstract

• Nets and Basic Search o Blind Methods Depth-first Search Breadth-first Search Non-deterministic Search o Heuristically Informed Methods Hill Climbing Beam Search • Nets and Optimal Search o The Best Path The British Museum Procedure Branch-and-Bound Search o Redundant Paths Discrete Dynamic Programming A* Procedure • Trees and Adversarial Search o Algorithmic Methods Minimax Procedure Alpha-Beta Pruning o Heuristic Method Progressive Deepening