Author: KarinsDad
Date: 11:14:23 05/16/99
Go up one level in this thread
On May 16, 1999 at 12:02:37, Andrew Dados wrote: [snip] > > Here we go: yet another schema to minimize _maximal_ neded space...:) >We need 5 pieces (excluding Kings) x 2 colors = 10 bit states >For packing 3 pieces together we need 10^3 = 1000 states, which fits in 2^10 (10 >bits) >so for 30 pieces (32- 2 kings) we get 12 bytes 4 bits... > > Now define 'format': >64 bits piece location bitmap >12 bits for 2 kings indexes and castle status (6 bits per king, first bit >indicates any castle status; if none then 5 others give [0..31] index of the >king, if any then kings position is known then 2 bits give details on status). >8 bits for 50 move counter+side to move >100 bits for up to 30 pieces 'packed' (see above) >4 bits EP possibility+EP file > > Total gets up to 23 bytes 4 bits worse case, any 3 pieces removed is 10 bits >less....all 32 piece (including 'fantasy') positions fit. >-regards- > Andrew Well, done! Simple and easy for the data packing. KarinsDad :)
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.