Computer Chess Club Archives

Search

Messages

Subject: Re: Hashing in distributed perft, forgot one important thing...

Author: Albert Bertilsson

Date: 00:32:28 12/19/03

Go up one level in this thread

I just forgot to mention one very important thing...

Hashing is only used for a single perft(8) calculation, for the next problem the
hash is cleared, so collisions can only occur within the same perft(8)
calculation which is crazy unlikly with 128 bit keys (even very unlikely with
64bit keys).

When the database looks for duplications the whole exact position is compared so
no problem there either.

/Regards Albert

• Re: Hashing in distributed perft, forgot one important thing... Uri Blass 02:54:04 12/19/03
• Re: Hashing in distributed perft, forgot one important thing... Joost Buijs 01:22:24 12/19/03
  • Re: Hashing in distributed perft, forgot one important thing... Sune Fischer 02:24:35 12/19/03
    • Re: Hashing in distributed perft, forgot one important thing... Albert Bertilsson 03:40:59 12/19/03

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.