Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Compact encoding of chess positions

Author: Reinhard Scharnagl

Date: 23:00:21 03/04/05

Go up one level in this thread


On March 04, 2005 at 17:33:44, Russell Reagan wrote:

>On March 04, 2005 at 04:36:19, Reinhard Scharnagl wrote:

Hi Russel,

>>We handle here valid chess positions of the traditional chess game
>>and calculate codelengths for a special subset of RELEVANT positions
>>matching ONE simple restriction (without relevance for practice):
>>
>>  "For each performed promotion there also must have been captures
>>  during the game: one pawn or half an officer."

>I think this assumption is not correct, or maybe I misunderstand it. It is
>possible to promote two white pawns for each black pawn captured. To promote all
>8 white pawns only requires 4 captured black pieces. Then you can promote all 12
>pawns. See my (legal) game below which demonstrates this.

this is a practical restriction, not an assumption.

What I claim is, that really played games will follow that assumption.

But because of a lot to be saved bits, even numerous positions with some such
unlikely promotions would fit into that length scheme.

Reinhard.



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.