Swipe to navigate through the chapters of this book
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.
Please log in to get access to this content
- Search, Games and Problem Solving
- Springer International Publishing
- Sequence number
- Chapter number
- Chapter 6