Author: Keith Kitson
Date: 02:48:47 09/20/00
Go up one level in this thread
I would expect a large position learning database, which continues to grow will use more of the processor time to search this growing database to a point where precious little time remains for the processor the execute much of the logic in the program for any given move. Plus as this learning db will be so large it will have to reside on disc, and so access times will be slower than hash memory. It doesn't seem to be the right way to go in the short term.
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.