Author: Pete Rihaczek
Date: 15:03:41 11/24/03
Go up one level in this thread
On November 24, 2003 at 16:14:12, Robert Hyatt wrote: >>I don't think it is _that_ revolutionary. IE a single FPGA board and >computer together search about 2.5M nodes per second, according to comments >by them when we have played a few skittles games on ICC. A dual-CPU opteron >is faster than that, as a reference point. > >yes, I know that he is running with four machines, two FPGA cards per machine >in Graz. But then again, 8-way opterons are around as well. I'm hardly >"anti-hardware" but the benefits to using hardware normally far-surpass >readily available general-purpose computers. IE belle did 160K when the >fastest competitor was 20K (Cray Blitz). Deep thought went to 1.5M when we >were at 200K with the fastest hardware Cray had at the time. The FPGA >approach doesn't have that significant speed advantage. IE a single card >at 2.5 M nodes per second is within reach of a single processor machine >today... Perhaps, but when DB2 beat Kasparov, the question was asked, if doing eval in hardware is so good, why not create a hardware card for your PC that does it? This is the first successful crack at it. As far as node speed, Kasparov does 2-3 nodes per second. If you could create an eval routine that would consistently evaluate a position as well as the best human grandmasters, how many nodes would the computer have to search to always find the best continuation, at least to the point that it consistently outplays all humans? The ability to make the eval as complex as necessary without penalty is probably worth a lot more than speed.
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.