Author: Roberto Waldteufel
Date: 03:26:40 08/13/98
Go up one level in this thread
On August 09, 1998 at 00:24:27, Danniel Corbit wrote: >What is the most compact known method for storing a chess position with all the >relevant information like castling status, en-passant squares, etc.? [Also best >move from here .. don't really care about what the test set is though...] >I want to store a large database of chess positions, and compaction would really >help. When I am finished, I will share the final specifications and the data >also, if anyone is interested. Hi Danniel, Check out http://caissa.onenet/chess/texts/FewBits for an interesting article about this. I seems that there are several approaches that offer promise - one claim is for 143 bits, but there is also an amazing claim by J Nievergelt that it can be done in significantly less than 100 bits. Best wishes, Roberto
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.