Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Minimum Number of Bytes - estimation

Author: Reinhard Scharnagl

Date: 19:34:44 12/24/03

Go up one level in this thread


On December 24, 2003 at 15:08:55, Dann Corbit wrote:

>On December 24, 2003 at 14:53:53, Reinhard Scharnagl wrote:
>
>>Hello Dann,
>>
>>thank you for the illustration. Now I have integrated the possibility of
>>encoding the position of kings and castling enabled rooks in one 12 bit
>>table, see: [http://www.rescon.de/Compu/schachzahl1_e.html] and following.
>
>This is a very interesting project for me.
>
>It might also be interesting to subtract positions from the maximum possible.
>
>After you have a minimal encoding where you cannot reduce it any further, then
>do a calculation to find out how many ways it is possible to have both kings
>simultaneously in check.  You can subtract this count from the total.
>
>I think your current board position may be the current record for a hard proof
>of the floor of possible board permutations.
>
>If you can encode them all, there cannot possibly be more board positions than
>that.

I already have tried to estimate somehow into that direction,
see at: [http://www.rescon.de/Compu/schachzahl1b_e.html].

Reinhard.



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.