Author: David Rasmussen
Date: 22:52:48 01/25/01
Go up one level in this thread
On January 25, 2001 at 19:05:12, Robert Hyatt wrote: >Think about it differently. IE at ply=N, I play a move and I am >about to do a normal search to depth=X to see how this move works. >But first, I assume my opponent does nothing, and I then do a much >shallower search with me to move again. If this is bad for me, there >is no need for me to search this move to the full depth, I can get away >with searching it to the shallower depth, proven by the null-move observation... > > It's still different from what I suggested. As Edward said: > >> >>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 My idea is more general.
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.