Author: Dan Andersson
Date: 03:15:03 08/15/99
Go up one level in this thread
That is correct, I try to prove the comdinatorics used to asses the possible nuber of positions is overestimating the positions, not by using combinatorical techniques but compression and codes. Thus lowering the amount of bits needed. This problem I feel is the 'Fermats Last Theorem' of computer chess. I know its impossible to enumerate N different states with less than log2(N) bits. Kinda basic, isnt it? Regards Dan Andersson
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.