Author: Dan Homan
Date: 04:57:00 09/16/99
Go up one level in this thread
On September 16, 1999 at 07:53:05, Jari Huikari wrote: >On September 16, 1999 at 07:37:38, Dan Homan wrote: > >>On September 16, 1999 at 06:21:26, Peter McKenzie wrote: >>>Thats all the move ordering I do except that when a new best move is found at >>>the root, it is moved to the front of the move list and all the other moves >>>are shuffled down. Do you do this? > >>This is what I did before. > >Just came into my mind: > >What if when found a new best move and moved it to the front of list... >Could it had happened that you then searched again a previously searched >shuffled down move in your loop? > > Jari Nope, because I always score the moves before I do any searching, so once I start searching a node, the order of moves is fixed. So at ply=3 the order of the moves is fixed by the results of the ply=2 search. - Dan
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.