Author: Slater Wold
Date: 12:21:35 09/01/02
Go up one level in this thread
On September 01, 2002 at 05:00:17, Alexander Kure wrote: >On September 01, 2002 at 04:47:33, Uri Blass wrote: > >[..] > >>I am surprised by the small number of nodes per second for brutus. >> >>61392knodes/1496 seconds is less than 50knodes per second. >>I thought that brutus was supposed to be a fast searcher because >>it is not a software but hardware that was designed for chess. > >The nodes shown are only the node of the software search. There is no node >counter for the hardware search. The number is somewhere between 2 - 3 Mio. >approximately. > >Greetings >Alex 2 - 3 million is still somewhat slow. If you take into consideration what HW will be used at the next WCCC, it is not hard to imagine Crafty will be getting close to 3M nps, and Deep Junior close to 6M. So you're back to relying on a higher quality search. However, I understand this can be remedied with a better FPGA or even more FPGAs. But of course, there is a reason why you're not doing that now. $.
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.