Author: Edward Screven
Date: 09:49:58 01/25/01
Go up one level in this thread
On January 25, 2001 at 09:34:05, Robert Hyatt wrote: >On January 25, 2001 at 08:20:26, David Rasmussen wrote: >>I mean, maybe many of the "unsound" pruning methods would be sounder if, instead >>of just pruning, they just adjusted the resulting depth down. In that way, a >>line would still be examined, only later. > > >This is what null-move search does, in essence... we must think about the null move heuristic differently, because i don't think its typical implementation is at all similar to what david suggested. sure, there is a reduced depth search involved, but it's part of the pruning test, not the pruning action. the pruning action is all or none -- completely prune the move from the parent node or search it in full. applying david's suggestion to a null move implementation would mean reducing the search depth after a null move failed high instead of simply returning immediately with a fail high. - edward
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.