Author: Francesco Di Tolla
Date: 12:24:05 10/08/01
Go up one level in this thread
>The only important knowledge at big depth is to know that ... Thanks for giving the proof that I'm right! you are right that a SINGLE cpu speed one program can find something that the other can't due to different node counts (and that can be compensated by the butter eval function). The point is that we are talking about testing at TWO speeds the same two programs. Than you argument must be recast. My guess is that generally one can have that the faster the harware the lesser the probability that the fast searcher will find a solution the other will not find (outerform by pure depth). This is beacuse the more speed the less extra depth you have. I don't see why the extra "chess knoveldge" should fade as well. I still don't see why program X playing at the same level of progam Y counting Z more plys than than program Y should still play at the same level with say 1/4 of that extra Z plys and same evaluation function for the two in the two cases. regards Franz
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.