Author: Tord Romstad
Date: 03:47:54 07/22/04
Go up one level in this thread
On July 22, 2004 at 06:29:45, Dan Honeycutt wrote:
>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.
>>
>>Tord
>
>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?
No, I don't.
>To me that seems logical and not too messy.
I agree that it seems logical, but I don't have a separate root search
function, and I don't want to clutter my search function with too many
if(Ply==0) { ... }
statements. It is very likely that I will try something like this in
my new engine, though (probably by using a separate root search function).
Tord
This page took 0.01 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.