Computer Chess Club Archives




Subject: Re: A move to search 2nd... Keep in the trans table?

Author: Dan Honeycutt

Date: 03:29:45 07/22/04

Go up one level in this thread

On July 22, 2004 at 06:06:15, Tord Romstad wrote:

>On July 21, 2004 at 22:09:58, Robert Hyatt wrote:
>>Nobody uses the transposition table to order the moves at ply=1.
>I do.  I agree that it might not be optimal, but it always seemed too messy
>and complicated to me to have a separate search function at the root level.
>The main search() function is called directly from the iterative deepening
>loop, and the same move ordering is used at the root as at all other nodes
>far from the leaves.

When you find a new best move at the root do you not reorder and keep the old
best move as second to be searched?  To me that seems logical and not too messy.

Dan H.

This page took 0.03 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.