Author: Tony Werten
Date: 16:37:41 01/27/01
Go up one level in this thread
On January 27, 2001 at 17:03:51, David Wilke wrote: >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? The ideas of Eugene (Nalimov) can be continued to bigger tbs' but unfortunately the reduction is just a few percent. Six pieces is a matter of waiting till the harddiscs are big enough, seven pieces need The Ather Oproache. ( OK Bas, time for you to get in :) ( Sorry insider joke ) Tony > >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?
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.