Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Hashing in distributed perft

Author: Paul Byrne

Date: 01:21:07 12/19/03

Go up one level in this thread


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.

It is (relatively) quick and easy to store a position in 24 bytes -- my chess
program does that for opening books and learning and such.  I'm sure one
can shave a few bytes off with some effort.  For 24 bytes, simply store
a bitboard showing which squares are occupied, and then for each piece in
order, 4 bits to say what piece (which gives 16 diffent pieces -- the extras
can be used for cover side-to-move, castling rights and en passant).

-paul



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.