Verified Null-Move Pruning

In this article we review standard null-move pruning and introduce our extended version of it, which we call verified null-move pruning. In verified null-move pruning, whenever the shallow null-move search indicates a fail-high, instead of cutting off the search from the current node, the search is continued with reduced depth. Our experiments with verified null-move pruning show that on average, it constructs a smaller search tree with greater tactical strength in comparison to standard null-move pruning. Moreover, unlike standard null-move pruning, which fails badly in zugzwang positions, verified null-move pruning manages to detect most zugzwangs and in such cases conducts a re-search to obtain the correct result. In addition, verified null-move pruning is very easy to implement, and any standard null-move pruning program can use verified null-move pruning by modifying only a few lines of code.

[1]  K. Thompson,et al.  BELLE: chess hardware , 1988 .

[2]  James R. Slagle.  Artificial intelligence : the heuristic programming approach , 1971 .

[3]  Romeo Çollaku,et al.  Deep thought , 1991, Nature.

[4]  Jonathan Schaeffer,et al.  The History Heuristic and Alpha-Beta Search Enhancements in Practice , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Hans J. Berliner,et al.  Chess as problem solving: the development of a tactics analyzer. , 1975 .

[6]  Scott Hamilton,et al.  Deep Blue's Hardware-Software Synergy , 1997, Computer.

[7]  Stefan Plenkner.  A Null-Move Technique Impervious to Zugzwang , 1995, J. Int. Comput. Games Assoc..

[8]  William Henry Carl Ebeling,et al.  All the Right Moves: A VLSI Architecture for Chess , 1987 .

[9]  Feng-Hsiung Hsu,et al.  IBM's Deep Blue Chess grandmaster chips , 1999, IEEE Micro.

[10]  H. Jaap van den Herik,et al.  The 7th World Computer-Chess Championship Report on the Tournament , 1992, J. Int. Comput. Games Assoc..

[11]  James J. Gillogly,et al.  The Technology Chess Program , 1972, Artif. Intell..

[12]  Ernst A. Heinz.  Adaptive Null-Move Pruning , 1999, J. Int. Comput. Games Assoc..

[13]  Hans J. Berliner.  Some Innovations Introduced by Hitech , 1987, J. Int. Comput. Games Assoc..

[14]  Alexander Reinefeld,et al.  An Improvement to the Scout Tree Search Algorithm , 1983, J. Int. Comput. Games Assoc..

[15]  Murray Campbell,et al.  Experiments with the Null-Move Heuristic , 1990 .

[16]  T. Anthony Marsland,et al.  A Comparison of Minimax Tree Search Algorithms , 1983, Artif. Intell..

[17]  David J. Slate,et al.  Chess 4.5-The Northwestern University chess program , 1988 .

[18]  J. Huisman.  The Netherlands , 1996, The Lancet.

[19]  P. Kent,et al.  Tree-searching and tree-pruning techniques , 1988 .

[20]  Barry L. Nelson,et al.  Hash Tables in Cray Blitz , 1985, J. Int. Comput. Games Assoc..

[21]  Jonathan Schaeffer.  The History Heuristic , 1983, J. Int. Comput. Games Assoc..

[22]  R M Hyatt,et al.  Cray Blitz , 1986 .

[23]  H. Berliner.  Computer chess , 1978, Nature.