Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Hashing in distributed perft

Author: Reinhard Scharnagl

Date: 05:00:30 12/19/03

Go up one level in this thread


On December 19, 2003 at 07:01:55, Reinhard Scharnagl 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.
>
>21 bytes will do that job using Huffman Position Encoding as shown on
>[http://www.rescon.de/Compu/schachzahl1_e.html].
>
>Regards, Reinhard.

in short I will extend that coding also to save e.p. information (by ONE
more bit), this moment only additional castling information is included.

Reinhard.



This page took 0.01 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.