Author: Jeremiah Penery
Date: 11:57:16 01/23/00
Go up one level in this thread
On January 23, 2000 at 14:15:12, Tom Kerrigan wrote: >On January 23, 2000 at 13:51:47, Jeremiah Penery wrote: > >>>Here's the issue at hand: The DB _algorithm_ can be implemented in software and >>>run on a PC. It would be on the order of 10,000 times slower, but it would still >>You think it could get 200k NPS on a PC? > >200M / 10k = 20k. I firmly believe that a PC program with DB's evaluation >function can run at (least!!) 20k NPS on a good PC. Whoops! There seems to be a bug in my math sub-routines. :) How fast does CS-Tal run on a fast machine? Less than 20k NPS, I think. DB is supposed to have a bunch more evaluation, which would probably make it a bunch slower. >>said PC. Not only would it get tactically killed by this, the evaluation may >>just be wrong at low depths. > >I don't see why a terrific evaluation function would be right at one depth and >wrong at another. If you write an evaluation with a 5-ply search in mind, what will you do differently than if you have a 14 ply search with tons of extensions in mind? Will you really put the same knowledge with the same weights in? I know Bob can give a good example from when he tested CB on the Vax, to make sure it was working right. They tuned something on the Vax, but it was broken on the Cray. The Vax wasn't getting deep enough to see the problems with a certain evaluation term they added...Hopefully he can explain it better.
This page took 0.01 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.