Solving games

Authors:
M. J. H. Heule;L. J. M. Rothkrantz
Affiliations:
Department of Software Technology, Faculty of Electrical Engineering, Mathematics and Computer Sciences, Delft University of Technology, Netherlands;Department of Mediamatica, Faculty of Electrical Engineering, Mathematics and Computer Sciences, Delft University of Technology, Netherlands
Venue:
Science of Computer Programming
Year:
2007

Citing 4
Cited 0

Solving 8 × 8 domineering

Theoretical Computer Science
Games solved: now and in the future

Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Solving Awari with Parallel Retrograde Analysis

Computer
Partition search

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce an alternative concept to determine the solvability of two-player games with perfect information. This concept - based on games currently solved - claims that the applicable solving procedures have a significant influence on the solvability of games. This contrasts with current views that suggest that solvability is related to state-space and game-tree complexity. Twenty articles on this topic are discussed, including those that describe the currently obtained solutions. Results include a description of the available solving procedures as well as an overview of essential techniques from the past. Besides well-known classic games, the solvability of popular and recent games zertz, dvonn, and yinsh are analyzed. We conclude that our proposed concept could determine the solvability of games more accurately. Based on our concept, we expect that new solving techniques are required to obtain solutions for unsolved games.