Author: Robert Hyatt
Date: 14:27: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. > >>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. > >-Tom That is an easy one to answer. Why doesn't everyone program every bit of chess knowledge they can into their evaluation function if that is true? Or does it have to do with trade-offs between knowledge and tactical search speed? A program can be _too_ dumb, even though it is very fast. Or it can be too slow, even though it is very smart. It is a very difficult balancing act. Hsu balanced what he could do in hardware vs his search in software. Disrupting one would disrupt the other badly... Remember that they _only_ got to a typical depth of 14-15 plies at 200M nodes per sec. I figure I could get to 19 with the current crafty running that fast. If you lop 5 plies off _my_ search today, I know what would happen to me...
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.