Author: blass uri
Date: 05:00:45 04/24/00
Go up one level in this thread
On April 24, 2000 at 06:57:50, Victor Zakharov wrote: >Theoretical calculations are very rough. Chess Assistant has algorithms of >variable length board compression (so called Direct tree). Results are >impressive. Average size is 12 bytes per position in Chess Assistant 4.0 and 11 >bytes in CA 5.0. And speed is good engough too. Two interesting observations: >there are a few positions that are packed in 56 bits (i.e. less than 64 bits and >less than one bit per a square!), and there are no positions packed more than 19 >bytes (144 bits). I believe that it is impossible because there are probably more than 2^144 legal positions. Uri
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.