Author: Robert Hyatt
Date: 15:18:39 11/06/01
Go up one level in this thread
On November 06, 2001 at 13:54:02, Joshua Lee wrote: >Tablebases are too slow. TB's slow down search to a rediculous point and will >make a 1Ghz machine think it's a P-90. >Is there any work being done to improve function of probing or what can be >changed about tablebases or anything that works with the tablebases to change >this? I don't have SCSI but i have two drives which are amongst the fastest IDE >drives you can buy 8.2 and 8.9ms access time, you can get SCSI drives that hover >around 4.9ms and up past 10,000 rpm. This i believe would'nt change the Search >hit. This probably has more to do with the first time the TB's are Accessed the >Program continues to Look Even if it didn't find anything to help so at ply's >1-20 Which will come by fast in the endgame are bogged down and now take much >longer. > >What exactly is the program looking at and how are the positions stored? I can't >imagine a bunch of EPD's for KPPKPP. >I would think that the compression and how the program looks for the position to >be it's Sore Spot. Are you using them compressed? That helps a lot on slower disks as it avoids I/O at the expense of processor speed. It should not slow down a program too much if the probe depth is set properly. If a program probes everywhere, including the q-search, then it will slow down to a crawl for sure.
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.