Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: A new take on the minimum binary board position

Author: KarinsDad

Date: 15:57:51 05/17/99

Go up one level in this thread


Squeeze a little more. Once there are 32 pieces found, then the rest of the
blanks do not have to be in the representation.

Also, once 31 pieces are found, a last piece in the last square does not need a
color bit.

 1 bit side to move
 1 bit ep not available (eps are smaller)
12 bits kings   (6 per)
32 bits blanks  (1 per)
47 bits pawns   (3 per minus last pawn color bit)
20 bits bishops (4 or 5 per)
20 bits knights (4 or 5 per)
20 bits rooks   (4 or 5 per)
10 bits queens  (4 or 5 per)
-1 color bit on 32nd piece
6+ extra promotion bits

Still 21 bytes. However, I am not positive that the promotion bits are required
in a real game position (better add in the king on the edge algorithm though),
so if those are dropped out, it is down to a maximum of 162 bits. 2 bits shy of
the magic 20 byte number.

KarinsDad :)



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.