Author: Ernst A. Heinz
Date: 07:31:56 03/30/00
Go up one level in this thread
Hi Bruce, >Has anyone experimented with dynamically adjusting R for nullmove reduction? >The idea is that some positions deserve R = 1, others R = 2, maybe some even >deserve R = 3, if your stomach is strong enough. "DarkThought WCCC'99" uses such a scheme and performs quite successfully with it. I named the new technique "adaptive null-move pruning". You can read more about adaptive null-move pruning and its performance (extensive experiments!) in my book "Scalable Search in Computer Chess" [http://supertech.lcs.mit.edu/~heinz/node1.html] and my article "Adaptive Null-Move Pruning" in the ICCA Journal, Vol. 22, No. 3, pages 123-132, September 1999. Cheers, =Ernst=
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.