Author: Alexander Kure
Date: 12:38:35 09/01/02
Go up one level in this thread
Dear Slater, >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. $. 2 - 3 million is excellent if you consider the complex evaluation which is done in the FPGA! The FPGA does not suffer from speed loss when adding more knowledge to the evaluation function because of paralellism! Brutus is not considered to be a fast searcher but a high class evaluator. Greetings Alex
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.