Computer Chess Club Archives


Search

Terms

Messages

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

Author: KarinsDad

Date: 09:33:18 08/18/99


I had a brainstorm (or a brain hiccough, depending on your point of view) this
morning.

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).

This particular idea overruled several other ideas that were previously used.
Additionally, it has exhausted the areas where I thought that an improvement may
be made. So, I think this is the best I can do. I will probably modify my white
paper on this and put it here in the Computer Chess Reports in September (August
is booked).

KarinsDad :)




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.