Author: Dan Homan
Date: 05:09:39 09/16/99
Go up one level in this thread
On September 15, 1999 at 18:19:22, William Bryant wrote: >Dan, >What specifically did you change in your root search to improve the quality >of your search? > I was fairly simple... I did just what I said in the previous post: I simply used the values returned (at the root) for each move at one iteration to sort them for the next iteration. This seemed to be an improvement over using the same scheme (hash, winning captures, killer, history) that I use at all other nodes. I didn't actually expect that it would work all that well, but the fail-soft values returned by my search apparently were reasonable. Please read my above response to myself to see that I have come down to earth a little about how great this is. - Dan >I would like to try it myself. > >William >wbryant@ix.netco.com
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.