Author: Ernst A. Heinz
Date: 13:52:02 03/19/98
Go up one level in this thread
On March 19, 1998 at 16:06:11, Christophe Theron wrote: >On March 19, 1998 at 11:45:39, Ernst A. Heinz wrote: > >>As reported in my ICCA Journal 20(3) article "DarkThought" performs >>recursive null moves until one side has no more pieces, i.e., it still >>does null moves in minor piece endgames with one piece per side. It >>does not use a special Zugzwang detection scheme but instead relies on >>its extensions and high search depths to overcome Zugzwang glitches. >> >>=Ernst= > >So it should never find the solution of the given position. I am curious >to know how you explain this miracle... No miracle at all -- everything already published in the above mentioned ICCA Journal article. "DarkThought" does not perform null move searches at frontier nodes. It uses fine-tuned deep search and single-reply extensions that work especially well in endgames. Just for the records: with single-reply extensions *disabled* "DarkThought" finds the mate after only 2236 nodes ... >The problem with zugzwang is that it doesn't add more plies to find the >solution in this case. It is that if you fail to detect it and keep on >using null move, you simply NEVER find the solution... True, but only if you always do the null move searches at the critical nodes. That's where extensions and searches of variable depth offer a way out as you never do two null moves in a row ... =Ernst=
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.