Author: Dann Corbit
Date: 11:30:08 01/30/02
Go up one level in this thread
On January 30, 2002 at 05:52:02, Peter McKenzie wrote: [snip] >I finally gave in and had a quick scan of this thread ... the argument here >seems pretty conclusive. Unless there is something else to this magical >compression scheme that was overlooked? Yes. Instead of trying to encode every chess position that is possible, you encode a subset. Let's suppose that I want to encode a mere trillion chess positions. Suppose further that I can average 3 bits per position and store the whole mess in 3 trillion bits. You tell me how the math works out.
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.