Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Computational question for mathematicians, philosophers & computer-geeks

Author: Dieter Buerssner

Date: 01:35:59 03/03/05

Go up one level in this thread


On March 03, 2005 at 01:09:27, Reinhard Scharnagl wrote:

>See at http://www.chessbox.de/Compu/schachzahl1b_e.html where it is shown, that
>in average there is a limit of 164 bit to store a complete 8x8 board situation.

Reinhard, you have repeated it several times. So I can repeat my contradiction
once in a while, too :-)

It is not shown (proven) on that page. Actually I have given you a disproof long
ago, including a legal game reaching a position that needed quite a few bits
more to store the reached position. To show it, you have to count somehow, how
many positions will fit in the 164 bit and how many won't. I personally don't
see how this could be done.

Of course I agree, that most/all "normal" (say in the sense of happening in real
games) positions will fit in those 164 bit. I also agree, that the scheme is
rather nice. But it will not help to estimate the number of legal chess
positions as given. Especially "there is a limit of 164 bit" is wrong. What "in
average" means in this context, I don't understand.

Regards,
Dieter



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.