Author: Bruce Moreland
Date: 10:54:27 10/29/99
Go up one level in this thread
On October 29, 1999 at 12:54:51, Robert Hyatt wrote: >On October 29, 1999 at 02:34:23, Ed Schröder wrote: >>NULL-MOVE gave every program who had not a decent selective search algorithm >>an improvement of over 200 elo points and for some certainly more. > >That is not even close. I have run many tests with and without null move. >The improvement (for many of my program versions) was 50-60. Not over 200. >I believe that Bruce did a similar test with Ferret some time back. And I >think he got a similar number. I have the capability to do this test, so I may have done it. I don't remember having done it. I implemented null move because of Donninger's article. It came with source code and enthusiasm. There was a previous paper by Goetsch and Campbell, but it lacked these elements, although it is very good and is useful. The Donninger article also came with some comments about secrets kept by commercial guys, which Donninger wasn't at that time. bruce
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.