Computer Chess Club Archives

Search

Messages

Subject: Re: Compact encoding of chess positions II

Author: Chris Welty

Date: 09:00:13 03/05/05

Go up one level in this thread

On March 05, 2005 at 10:12:33, Reinhard Scharnagl wrote:

r3k3/8/8/8/8/8/8/4K3 w q - 0 1

and

r2k4/8/8/8/8/8/8/4K3 w - - 0 1

get encoded to the same number in your scheme, so while it is compact it is also
a lossy compression scheme.


Also, you're using your "estimated average" length of 152.5 instead of your
upper bound of 172 bits so it's not really an upper bound calculation.

>Average saving of color Bits                     =    2;
>Average saving of piece code Bits:               =    6;

>filling matrix redundances:       - 1.1 Bits
>e.p. bit redundances:             - 1.0 Bits

what are these?

Chris

• Re: Compact encoding of chess positions II Reinhard Scharnagl 11:46:06 03/05/05
  • Re: Compact encoding of chess positions II Chris Welty 22:09:44 03/05/05
    • Re: Compact encoding of chess positions II Reinhard Scharnagl 01:32:04 03/06/05

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.