Computer Chess Club Archives


Search

Terms

Messages

Subject: Mathematical limit forced by K. D. 's position vice. Any formal proofs?

Author: Dann Corbit

Date: 08:29:47 10/22/99

Go up one level in this thread


On October 21, 1999 at 12:01:54, KarinsDad wrote:
[snip]
>I have been attempting to compress them into 20 bytes (160 bits) or less for the
>last 6 months or so. I believe (unless I have made a mistake) that I have an
>algorithm that does 161 bits or less (out of 351 different cases, 13 of them
>require 161 bits, the rest require 160 bits or fewer).
>
>It would be interesting (although not really useful) if someone could get to
>that magical 160 bit level, just in order to say that it could be done.
>
>It would be good to have some competition since I think most everyone else here
>that was thinking about it has basically given up on it.
I think your 161 bits is a very important theoretical development.  You should
publish your encoding to a scientific journal.  If correct, it is absolute proof
that there can be no more than:
2.923e48
distinct legal positions in the game of chess.  Everything I have ever seen
before was just an estimate.  I have never seen a formal proof to limit the
number to an absolute ceiling of any type.  Has anyone else?



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.