Computer Chess Club Archives

Search

Messages

Subject: Re: OOPS! Shortening Huffman coding + OT

Author: Jeremiah Penery

Date: 17:08:00 11/08/99

Go up one level in this thread

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.

• Re: OOPS! Shortening Huffman coding + OT blass uri 20:24:30 11/08/99
  • Re: OOPS! Shortening Huffman coding + OT Jeremiah Penery 15:22:51 11/09/99
    • Re: OOPS! Shortening Huffman coding + OT Les Fernandez 23:36:35 11/10/99
      • Re: OOPS! Shortening Huffman coding + OT KarinsDad 09:02:40 11/11/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.