Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: did you see how chessbase is worry about explaining the defeat...

Author: Georg v. Zimmermann

Date: 03:32:19 11/25/03

Go up one level in this thread


there is one "little" flaw in your "argument".
Chessbase is the main sponsor of Brutus development since Oktober 2000.

Apart from that Chessbase is pretty obviously not trying to explain a defeat,
they are just giving some information about Brutus.

But do not quail, my friend. You are in good company here on CCC. Very few seem
to check the facts before making accusations, insults, or statements here.

Georg



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



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.