Game-Tree Search Using Proof Numbers: The First Twenty Years

Akihiro Kishimoto*, Mark H. M. Winands, Martin Müller, Jahn-Takeshi Saito

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

25 Citations (Web of Science)

Abstract

Solving games is a challenging and attractive task in the domain of Artificial Intelligence. Despite enormous progress, solving increasingly difficult games or game positions continues to pose hard technical challenges. Over the last twenty years, algorithms based on the concept of proof and disproof numbers have become dominating techniques for game solving. Prominent examples include solving the game of checkers to be a draw, and developing checkmate solvers for shogi, which can find mates that take over a thousand moves. This article provides an overview of the research on Proof-Number Search and its many variants and enhancements.
Original languageEnglish
Pages (from-to)131-156
JournalICGA Journal
Volume35
Issue number3
DOIs
Publication statusPublished - Sep 2012

Cite this