Author: Bruce Moreland
Date: 01:22:28 08/14/99
Go up one level in this thread
On August 14, 1999 at 01:25:50, KarinsDad wrote: >I wrote a white paper on compressing a random legal position into 20 bytes. >Unfortunately, I have not been successful on that. Until I am, that white paper >stays put (actually, I have basically convinced myself that it cannot be done, >so I doubt I will ever publish that paper). It can be done if and only if there are <= 2^160 legal positions in chess. The technique would involve assigning each legal position a unique number and storing that number. You can't do any better than this. Assuming that there are more than 2^160 legal positions, you still may be able to store typical positions in fewer than 160 bits, but only at the cost of storing less common positions in more than 160 bits. bruce
This page took 0.01 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.