Author: Gerd Isenberg
Date: 08:32:00 04/28/04
Go up one level in this thread
On April 28, 2004 at 09:44:01, Vincent Diepeveen wrote: >>I tried double nullmove suggested by Vincent too, without any precondition like >>eval - margin >= beta. Vincent is probably right - it seems to work great, and >>solves a lot of test positions a few percent faster. But with some positions, > >And how many plies does double nullmove on average search deeper in a normal >chess position? It looks like iterations terminate about 5-10% earlier on average. I fear my BF isn't that good to earn an additional ply in standard matches. My impression with your really great double nullmove idea is that it doesn't work so good in critical and probably game decisive positions, even in early middlegame root positions. But of course that may be due to my implemetation and sideeffects with other things in my search. >Like ones you get in GAMES in TOURNAMENTS, when compared to >either of the 2 verification searches (either Omid's or the original >verification search). > >I was completely outsearching you in that endgame we had. Yes that may happen, specially in completely won versus lost positions. Cheers, Gerd
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.