Author: Gerd Isenberg
Date: 09:45:03 02/08/03
Go up one level in this thread
On February 08, 2003 at 11:40:06, Ulrich Tuerke wrote: >On February 08, 2003 at 02:42:34, Vincent Diepeveen wrote: > >>cross posted at rec.games.chess.computer: >> >>Subject: An interesting forward pruning experiment - with pseudo description >>Date: Fri, 07 Feb 2003 23:51:19 GMT > >Hmm, I can't really get the idea behind this. > >IMHO, a null move is used to refute the preceeding move. In case of refutation, >the null move search fails high. > >Your reduction now comes in case the null move search fails low. So, these are >the cases, where the preceeding move could not be refuted. Hi Uli, But only by doing nothing. > Why then, shouldn't >we reduce depth for the remaining search ? These are just the potentially >interesting positions. I can't help it but it doesn't seem logical to me. > >I suspect that you trick will prune off lots of interesting nodes. Due to the alpha-3/4Pawn fail high, one assumes the side moving twice has no "real" threats. Because of the nullmove condition, the first (legal) move is already consired weak and may be most often refuted. I guess it is not too risky to believe a "reduced" cutoff with a rather huge search depth left (>= 6). See you, Gerd > >Uli
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.