Search, Games and Problem Solving

Abstract

Many AI problems, like automated theorem proving, game playing, planning or routing, involve combinatorial search in large discrete spaces. We introduce the classical uninformed and heuristic search algorithms such as for example A⋆ and apply them to simple examples. Game search techniques like minimax and alpha-beta pruning and their application in chess computers are discussed.