Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: OOPS! Shortening Huffman coding + OT

Author: Jeremiah Penery

Date: 15:22:51 11/09/99

Go up one level in this thread


On November 08, 1999 at 23:24:30, blass uri wrote:

>On November 08, 1999 at 20:08:00, Jeremiah Penery wrote:
>
>>On November 03, 1999 at 17:25:43, blass uri wrote:
>>
>>>I generated a program to find an upper bound on the number of legal positions by
>>>the same idea some monthes ago.
>>>
>>>It found the number
>>>3.7010630121207222927827147741452119115968e46
>>>when you ignore the side to move right to castle and the 50 move rule
>>
>>
>>What was the formula you used to get this number?  Have you (or anybody else)
>>tried to run it in Maple or Mathematica?  I think they can do
>>arbitrary-precision math, and quite quickly.
>
>I simply found for every material configuration an upper bound for the number of
>possible positions and calculated sum of the upper bounds.
>
>It is possible to improve the bound by using more inequalities

If you have it handy, could you post it here?  I don't think I could figure it
out right now. :(



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.