Author: Dezhi Zhao
Date: 13:28:09 12/18/02
Go up one level in this thread
I read some days ago you experimented the verified null move idea with Crafty and some encouraging results. However, have you decided to keep the change? I think the VR=3 search is more akin to R=3 search in the long run. This idea seems to me is that you verify with reduced depth a likely cut node that was detected by a fast R=3 null move search. Though cheap screening (R=3) and expensive verification (reduced depth search) sounds a reasonable trade-off, all the sub-nodes of the verfication are still searched by using the less-reliable R=3 again. The verification could fail the same way as standard R=3 to some less extent. I think the validation process of the verified null move in a real program like Crafty could be lengthy.
This page took 0.01 seconds to execute
Last modified: Thu, 07 Jul 11 08:48:38 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.