Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Schema for storing all possible legal positions in 24 bytes

Author: Peter Klausler

Date: 14:44:23 05/17/99

Go up one level in this thread


On May 17, 1999 at 15:15:01, KarinsDad wrote:

>Andrew has a simpler packed format than the one I mentioned above in my post
>that fits into 22 bytes. His is currently at 174 bits, the same as the one you
>mention below. If you could post the 174 bit representation that you mentioned,
>I would appreciate it.

Well, if memory serves:

12 = 2 * 6 bits for the positions of the Kings
62 bits for a mask of the other occupied squares
100 bits for a 30-digit (decimal) integer specifying their contents

This is exclusive of the other six bits that you always
need for the side on move, castling rights, and en passant.

Representations smaller than 192 bits (24 bytes) are not
likely to have much more than curiosity value unless one
can get down to 160 bits (20 bytes).



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.