Adaptive Null-Move Pruning
E.A. Heinz · ICGA Journal · 1999
General wisdom deems strong computer-chess programs to be “brute-force searchers” that explore game trees as exhaustively as possible within the given time limits. We review the results of the latest World Computer-Chess Championships and show how gr