Table of Contents Author Guidelines Submit a Manuscript
Advances in Artificial Intelligence
Volume 2013 (2013), Article ID 357068, 9 pages
Research Article

Tree Pruning for New Search Techniques in Computer Games

Distributed Computing Systems, Belfast, UK

Received 28 May 2012; Revised 10 October 2012; Accepted 24 October 2012

Academic Editor: Srinivas Bangalore

Copyright © 2013 Kieran Greer. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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. The sequence is then returned based on the current move only. This is therefore position independent and 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. Finally, a completely new search process will be suggested for computer chess or games in general.