Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Hashing in distributed perft

Author: Russell Reagan

Date: 01:49:26 12/19/03

Go up one level in this thread


On December 19, 2003 at 04:31:14, Paul Byrne wrote:

>On December 19, 2003 at 04:26:23, Russell Reagan wrote:
>
>>On December 19, 2003 at 02:06:06, Joost Buijs wrote:
>>
>>>I have the same thougths about this. Only if you store the positions perfectly
>>>this approach can be valid. I don't know how much space you need to store a
>>>position, probably it is somewhere around 22 bytes.
>>
>>There is no reason to store every single position. You only have to count them,
>>not store them.
>
>You could use such compacted positions in a hash table though with no chance
>of collisions...
>
>-paul

Ah, I see. I was going down a different road. My mistake :)



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.