Author: Edward Heddle
Date: 02:14:47 12/27/99
I'm new here. I am not actually involved in programming, but more the theory of programming. My question is; how do null move reductions work; i.e, at what points in the search tree are null moves tried? Thanks Ed ;)
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.