Perspectives on Future Work

Abstract

The successful performance of AEL pruning demonstrates that aggressive forward pruning can actually work very well in computer chess, especially at high search depths. Moreover, even the cumulative combination of several dynamic and static forward-pruning methods need not necessarily compromise the tactical strength of the search. Hence, the quest for new successful forward-pruning techniques in computer chess looks more promising than ever. Future increases in search speed and search depth (enabled by faster machines with larger memory capacities) further add to this promise.