Author: Pete Rihaczek
Date: 11:17:31 11/25/03
Go up one level in this thread
On November 25, 2003 at 06:14:35, Ricardo R Santana wrote: >I´ve just in chessbase page to see that Brutus (congratulations !!!) beat >Fritz...but did you see how chessbase tried to explain the defeat ?? >" >Donninger's program was constructed for Field Programmable Gate Array (FPGA) >systems. These are essentially programmable chips which have the advantage is >that anything programmed this way will run very much faster than on a general >purpose chip like the Pentium or Athlon. > >An additional benefit is that due to the parallel sturcture of the code you can >add chess knowledge in any quantity without slowing down the search. In regular >PC programs each new quantum of knowledge is bought at the price of search >speed. >" > >bla bla bla.... something like this: Brutus had a much better hardware...ok, but >I´ve never seen this kind of explanation when we see Fritz or other in 1 on ssdf >(I remeber when chessbase programs got first places, but they were the only one >who had better hardware...) >see you >Ricardo It seems they hedge by entering Fritz as "Quest", an 'experimental version of Fritz'. This can offer an escape in the event of a poor showing. If Quest loses, Fritz did not lose. If Quest wins, Fritz is new and improved. ;)
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.