Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Min # of bits needed to store a chess position

Author: KarinsDad

Date: 12:17:03 04/21/00

Go up one level in this thread


On April 21, 2000 at 13:21:56, J. Wesley Cleveland wrote:

[snip]
>
>I don't think so. Say you use the simplest Huffman of 3 bits for pawns, and 4
>bits for other pieces. For every two promotions (adds 2 bits), one man must be
>removed (subtracts 3-4 bits), so the total length is smaller.

Almost, but not quite. The simplest Huffman of 2 bits for pawns, and 4 bits for
other pieces.

Worst case scenario, for every three promotions (adds 6 bits), one pawn must be
totally removed (subtracts 2 bits), so the total length is larger. Overall, +4
bits. Since there could be up to 12 pawn promotions in a position, this would
add +16 bits maximum.

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.