Author: Paul Richards
Date: 09:52:09 07/14/99
Go up one level in this thread
On July 14, 1999 at 10:29:56, Robert Hyatt wrote: >Tablebases are not nearly so hard to compute as they are to store, already. >Just remember that you need roughly 64^N bytes, where N is the number of >pieces on the board counting kings. for N > 5, this is _huge_. For N=6 this is 64 Gig. Big, but you can store that on an array with 18 Gig drives with room to spare for a lot less than the cost of quad-Xeon. :) I thought the big problem with 6 piece tablebase files is the time it would take to generate them?
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.