Author: Dann Corbit
Date: 12:11:51 09/28/99
Go up one level in this thread
On September 28, 1999 at 15:04:38, Dave Gomboc wrote: >On September 28, 1999 at 14:42:24, Dann Corbit wrote: > >>On September 27, 1999 at 12:11:16, KarinsDad wrote: >> >>>I had wanted (and promised) to send a white paper to CCC this month on the topic >>>of compressing any legal random position into 20 bytes. However, I have so many >>>irons in the fire right now, that I am having difficulties getting time to work >>>on anything chess related (my program included). >>> >>>But, I wanted to update people on my progress. >>> >>>I currently have 13 cases out of 351 of 161 bits. The other 338 cases are 160 >>>bits or fewer. However, I am not positive of the accuracy of this data due to >>>the complexity of one of the algorithms. But, it appears to be fairly close to >>>being accurate. I have been working a little on finishing this one algorithm in >>>order to finish the white paper, but it is slow going. >>> >>>Again, my apologies. >>In that case, we'll let you live -- as long as you can get the size down to 140 >>bits. >>;-) > >Not even 160 bits? Man, are you harsh. <g> I was cutting him a ton of slack. I have a friend who thinks he can get it down to around 100. ;-)
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.