Game Solvers
Games have simple, fixed rules as well as clear results such as win, draw, or loss. However, developing algorithms for solving games has been a difficult challenge in Artificial Intelligence, because of the combinatorial complexity that the algorithms must tackle. This chapter presents an overview of successful approaches and results accomplished thus far on game solving. Conducting tree search is a standard way to solve games and game positions. Remarkable progress has been made in developing efficient search algorithms over the last few decades. The chapter describes several standard techniques including αβ search, proof-number search, and endgame databases.Citation
A. Kishimoto, M. Mueller. "Game Solvers". Handbook of Digital Games and Entertainment Technologies, pp 1-20, October 2015.| Keywords: | AND/OR tree, Search, αβ algorithm, Proof-number search, df-pn, Endgame databases |
| Category: | In Book |
| Web Links: | Springer |
BibTeX
@inbook{Kishimoto+Mueller:15,
author = {Akihiro Kishimoto and Martin Mueller},
title = {Game Solvers},
Booktitle = {Handbook of Digital Games and Entertainment Technologies},
Pages = {1-20},
year = 2015,
}Last Updated: June 30, 2020Submitted by Sabina P
