Author: David Wilke
Date: 14:03:51 01/27/01
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?
This page took 0.01 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.