Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Simple Hash Table Question

Author: Robert Hyatt

Date: 20:21:34 05/23/04

Go up one level in this thread


On May 23, 2004 at 22:24:37, William Bryant wrote:

>On May 23, 2004 at 20:40:46, Robert Hyatt wrote:
>
>>On May 23, 2004 at 19:40:04, William Bryant wrote:
>>
>>>I am using a split table, depth priority and always replace.
>>>
>>>If the entry in the depth priortiy table has an entry that matches the hash sign
>>>and
>>>entry type is invalid, but the entry has a best move,
>>>does this best move get used over a best move stored in the always replace table
>>>if
>>>it has a different best move?
>>>
>>>My thought is yes it does.
>>>
>>>William
>>
>>
>>You really should not have the _same_ position in both tables.  The entry in the
>>depth-preferred is more accurate.
>
>So, I hope that one of the two tables generates a cutoff,
>but if not, search the bestMove.
>
>If both tables have a bestMove, use the depthPreferred move.
>
>William


I don't even allow a duplicate into the always-store table, if there is an entry
in the depth-preferred table with a matching signature.  IE position X is in one
or the other but not both...




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.