Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Arithmetic coding of chess piece positions

Author: Ricardo Gibert

Date: 09:29:05 11/16/99

Go up one level in this thread


On November 16, 1999 at 12:00:57, KarinsDad wrote:

>On November 16, 1999 at 07:51:58, Ricardo Gibert wrote:
>
>>On November 15, 1999 at 22:06:03, Peter McKenzie wrote:
>>
>
>[snip]
>>>
>>>Of course none of what you say refutes what I said, because I said 'any given
>>>position' (which means any possible position) couldn't be compressed into 64
>>>bits.
>>
>>KQK can be compressed into less than 64 bits.
>
>I think what Peter was saying is that any random (i.e. any possible) position
>may or may not be compressed within 64 bits, but you cannot guarantee that it
>will. KQK is not a random position, but rather one which is known to compress
>within 64 bits.
>
>KarinsDad :)

Yeah, I know, but I'm having fun! :)



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.