Computer Chess Club Archives

Search

Messages

Subject: Re: Dr Hyatt : hash collisions and short keys

Author: Russell Reagan

Date: 17:03:10 08/20/02

Go up one level in this thread

On August 20, 2002 at 18:54:29, David Hanley wrote:

>It occurs to me that it matters a lot where the false matches occur.  A false
>high score one step away from the root can obviously result in a blunder being
>played.  I guess my only option is to experiment...
>
>dave

When you are very close to the root you could simply not probe the hash table.
It will take no time at all to do that very reduced search compared to the
entire tree you are searching.

If this is a bad idea, someone please correct me.

Russell

• Re: Dr Hyatt : hash collisions and short keys Robert Hyatt 18:52:05 08/20/02
  • Re: Dr Hyatt : hash collisions and short keys Russell Reagan 19:44:28 08/20/02
    • Re: Dr Hyatt : hash collisions and short keys Robert Hyatt 21:18:40 08/20/02
      • Re: Dr Hyatt : hash collisions and short keys Russell Reagan 21:54:29 08/20/02
        • Re: Dr Hyatt : hash collisions and short keys Robert Hyatt 08:38:01 08/21/02
        • Re: Dr Hyatt : hash collisions and short keys José Carlos 00:11:45 08/21/02

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.