Author: Kim Roper Jensen
Date: 05:56:06 06/17/03
Go up one level in this thread
On June 17, 2003 at 08:46:21, Uri Blass wrote: >On June 17, 2003 at 08:25:32, Kim Roper Jensen wrote: > >>Hi >> >>After reading the posts regarding hashtables, where Robert Hyatt and others show >>that the most significant improvements is in the 24M-96M area I was thinking >>about the whole hashtable thingie... > >I do not understand what is special in the 24M-96M that make it more important >than the 6M-24M area and other areas that you multiply the hash size by 4. > See this http://fortuna.iasi.rdsnet.ro/ccc/ccc.php?art_id=291166 taking a little out of context: "the speed break-even point seems to be around 96M for fine-tuning, or around 24M if you look only for large speedups. for 24M hash size, that is 1.5M entries. Compared to 291M total nodes in the tree." > >> >>Reading some papers(of course i forgot which, i will try to locate again) it >>seems that stuffing more of the PV in the hashtable will improve the efficiency >>another notch(article states 3% in middlegame and 12% in the endgame) > >I do not see how can it help. >I have a pv array. > >Uri See this http://citeseer.nj.nec.com/60323.html page 8, Transposition Tables in Computer Chess Dennis M. Breuker, Jos W.H.M. Uiterwijk
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.