Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Major Breakthrough on the 20 Byte Problem!!!

Author: David Eppstein

Date: 16:41:24 08/18/99

Go up one level in this thread


On August 18, 1999 at 12:33:18, KarinsDad wrote:
>I dropped the number of failures from 47 out of 351 to 18 out of 351.
>I dropped the maximum number of bits required from 164 to 162.
>There are now 2 162 bit cases and 16 161 bit cases (based on work so far, but
>this is a fairly complex algorithm, so there is a chance of a mistake; I will
>have to do more work to verify these numbers).

Doesn't 2 * 2^162 + 16 * 2^161 > 2^165?
So even ignoring the cases you can't handle, you still have 166 bits required.
Why do you say the maximum required is 162?



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.