Distributed Chess Theory Was: Re: [rc5] v3

Sebastian Kuzminsky kuzminsk at taussky.cs.colorado.edu
Tue Oct 28 11:38:13 EST 1997

"Skip Huffman" <SHuffman at Atl.Carreker.Com> wrote:
] Let's see ... to describe a move you need two pieces of information,
] the piece that is moving and its destination.
] To describe the piece we need four bits (no need to determine color, it
] will always alternate white/black).  To describe its destination you
] need an additional six bits.  So ten bits per move.  

   Slight optimization:  you never need more than 5 bits to encode the
destination, and usually less.  The piece with the highest number of
possible moves is the unobstructed queen.  This piece has max 28
possible places to go.  The rooks and bishops never have more than 14
places to go.  The knights and kings have no more than 8 places to go,
and the pawns have one or two.

   Given a board, it's easy to enumerate the possible destination
squares for a given piece.  The destination encoding just needs to
select between the available choices.


To unsubscribe, send email to majordomo at llamas.net with 'unsubscribe rc5' in the body.

More information about the rc5 mailing list