Author: Thomas Mayer
Date: 08:05:50 12/20/03
Go up one level in this thread
Hi Vincent, >> Anyway, let's try a guess and take the idea of Christoph Theron that >> hashtable doubling is about 7 Elo... We have 10 doublings, so 70 Elos >> expected... Doubling in speed is expected with around 60 Elos... So I >> expect a speedup of about 120-150%... How far am I away ?! :) > i don't want any elo answer, that's bullshit of course. Above 12 ply (without > forward pruning and with some extensions and checks in qsearch) another ply > matters shit. The question asked here is: "what does it matter for search > depth". ? Maybe you should reread my statement... Using the Théron rule of doubling hash size I expect a speedup of 120%-150% in time to depth... Shall I give you a number ? That means when in a certain position it takes with lower hash 600 seconds to a specific depth I expect that it would take only 240 seconds with the higher amount of hashtables... The last part of your statement is beyond my understanding - you say that another ply matters shit and on the other hand you want to know "what does it matter for search depth"... to me depth and ply has some relation, right ? Can you explain me now what you want ? (Besides, I fully disagree that above 12 ply another ply matters shit... at least not in my experience with my own program... when you say without forward pruning you mean without anything else then nullmove with R=3, am I right ?) Greets, Thomas
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.