Author: Bruce Moreland
Date: 20:44:06 08/14/99
Go up one level in this thread
On August 14, 1999 at 19:54:45, Dan Andersson wrote: >Exactly what I was talking about. I did not mention practical cases did I. > >Regards Dan Andersson I don't know if we are talking about the same thing. I said that if there are N legal positions, you can't get it below an average of log2(N) bits. I thought you were trying to reduce it below that. It isn't possible. bruce
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.