Computer Chess Club Archives

Search

Messages

Subject: Re: KD's 20-byte thing

Author: Bruce Moreland

Date: 16:49:11 08/14/99

Go up one level in this thread

On August 14, 1999 at 18:31:00, Dan Andersson wrote:

>I have done some research into this. As of now I havent proven anything, but
>even some simple compression schemes promise many more bits of compression.
>In the order of 20-30  bits, there may be some errors but it does not seem
>seriously flawed.
>
>Regards Dan Andersson

This isn't about compressing practical cases, it's about finding the minimum
number of bits necessary to do the worst possible case.  If we can determine how
many legal positions P there are, log2(P) will specify the minimum number of
bits necessary to encode any of them.

bruce

• Re: KD's 20-byte thing Dan Andersson 16:54:45 08/14/99
  • Re: KD's 20-byte thing Bruce Moreland 20:44:06 08/14/99
    • Re: KD's 20-byte thing Dan Andersson 03:15:03 08/15/99

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.