Author: KarinsDad
Date: 12:01:20 05/19/99
Go up one level in this thread
On May 18, 1999 at 21:20:10, Will Singleton wrote: >On May 18, 1999 at 09:29:52, Andrew Williams wrote: > >>On May 18, 1999 at 09:08:45, Steffen Jakob wrote: >> >>[snip] >> >>> >>>A different thing: currently I experiment with using the number of searched >>>nodes for each move in the root search to sort the move list. I know that Bob >>>and Bruce are doing this too. Anybody else? Any experiences? >>> >>>Greetings, >>>Steffen. >> >>I tried this and it didn't help me much. My approach is to retain the list >>of moves at the root and keep track of the score for each one. This is a bit >>more complex, but it works well for my program. >> >>Andrew > >I use the method given by Steffen. Seems to result in better move ordering for >me. btw, how do you get the score for root moves that aren't the best move? > >Will I do not know how Andrew does it, but you could fake your program out into thinking the root node was each position one ply down (temporarily) and getting an "actual" score for each move that way (but this may mess up a lot of your other search code). KarinsDad :)
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.