Dynamic Move Chains -- a Forward Pruning Approach to Tree Search in Computer Chess

by   Kieran Greer, et al.

This paper proposes a new mechanism for pruning a search game-tree in computer chess. The algorithm stores and then reuses chains or sequences of moves, built up from previous searches. These move sequences have a built-in forward-pruning mechanism that can radically reduce the search space. A typical search process might retrieve a move from a Transposition Table, where the decision of what move to retrieve would be based on the position itself. This algorithm stores move sequences based on what previous sequences were better, or caused cutoffs. This is therefore position independent and so it could also be useful in games with imperfect information or uncertainty, where the whole situation is not known at any one time. Over a small set of tests, the algorithm was shown to clearly out-perform Transposition Tables, both in terms of search reduction and game-play results.


page 1

page 2

page 3

page 4


Dynamic Move Tables and Long Branches with Backtracking in Computer Chess

The idea of dynamic move chains has been described in a preceding paper ...

Game Tree Search in a Robust Multistage Optimization Framework: Exploiting Pruning Mechanisms

We investigate pruning in search trees of so-called quantified integer l...

Knowledge-Based Paranoia Search in Trick-Taking

This paper proposes knowledge-based paraonoia search (KBPS) to find forc...

HEX and Neurodynamic Programming

Hex is a complex game with a high branching factor. For the first time H...

Two Error Bounds of Imperfect Binary Search

Suppose we know that an object is in a sorted table and we want to deter...

Developing a Successful Bomberman Agent

In this paper, we study AI approaches to successfully play a 2-4 players...

Comparative study of performance of parallel Alpha Beta Pruning for different architectures

Optimization of searching the best possible action depending on various ...