Author: Ernst A. Heinz
Date: 10:09:24 01/28/01
Go up one level in this thread
>Can tablebases be improved upon even more than they already are? Currently there >are several "types" of tablebases, being the Nalimov, Thompson, and others. Can >there not be a "best" solution for how to construct them to smaller in size, and >hold more information? > >A new compression method perhaps? > >As hard drives get bigger and faster, would it not be more beneficial to make >tb's smaller, easier to make, so that one day, chess could be solved by >tablebases alone? Is this even possible? Hi David, For an example of how to further decrease the sizes of endgame databases, please take a look at my following article in the ICCA Journal: * E.A. Heinz. Knowledgeable encoding and querying of endgame databases. In ICCA Journal, Vol. 22, No. 2, pages 81-97, June 1999. An electronic preprint of the article is available on my WWW pages at http://supertech.lcs.mit.edu/~heinz/. Cheers, =Ernst=
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.