Author: Robert Hyatt
Date: 07:39:41 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. > >Tord I'll ask again. _how_ can you use the transposition table to order moves at the root position? That is a single position. How many "best" moves can you store in a single transposition position and how do you sort them to figure out which is best, second best, third best, etc... You don't have to have a separate search for ply=1 if you don't want to, while still treating ply 1 differently as I do...
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.