The game of Nine Men's Morris is a draw. We obtained this result using a combination of
endgame databases (1010 states) and search. Our improved algorithm for computing …

Searching for solutions in games and artificial intelligence Page 1 Searching for solutions in
games and artificial intelligence Citation for published version (APA): Allis, LV (1994) …

We develop a new method called decomposition search for computing minimax solutions to
games that can be partitioned into independent subgames. The method does not use …

Combinatorial game theory provides an exciting approach to the analysis of games: It allows
the decomposition of a game into a sum of local games. In contrast to classical game theory …

The max n algorithm for playing multi-player games is flexible, but there are only limited
techniques for pruning max n game trees. This paper presents other theoretical limitations of …

Abstract In August 1992, the World Checkers Champion, Dr. Marion Tinsley, defended his
title against the computer program Chinook. The best-of-40-game match was won by Tinsley …

We present the rules of a game that was designed to be difficult for computers to play using
a brute force tree search approach. The rules of the game are simple and intuitive enough …

Almost all game tree search procedures used in artificial intelligence are variants on
minimaxing. Until recently, it was almost universally believed that searching deeper on the …

Although theoretic performance measures of most game-searching algorithms exist, for
various reasons their practicality is limited. This paper examines and extends the existing …

Is Nine-Men's Morris, in the hands of perfect players, a win for white or for black--or a draw?
Can king, rook, and knight always defeat king and two knights in chess? What can Go …