Author: Will Singleton
Date: 18:20:10 05/18/99
Go up one level in this thread
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
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.