Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: DB vs Kasparov - Who won?

Author: Dann Corbit

Date: 16:41:12 01/20/00

Go up one level in this thread


On January 20, 2000 at 12:15:33, Peter Kappler wrote:
[snip]
>I'd expect DB2 to win, but I think it would be closer than people expect.  It
>certainly wouldn't blow the micros off the board.

But we are talking about old technology verses new.

Consider {back to the present}:
The fastest incarnations of RS/6000 do 3+ teraflops.  That's 3,000 gigaflops or
3,000,000 megaflops.

The new Hsu chips are much faster than the predecessors.

Take a new RS/6000 ("fully loaded") and add as many Hsu/Campbell processor
systems as will fit into it.  It is potentially one thousand times as powerful
as the old system.  Why not?  Now, add in a full complement of 8 piece tablebase
files (calculated by that machine).

If it were their goal, IBM, Hsu and company could make a chess machine that
would crush a team of Kasparov + Old-Deep-Blue [Just conjecture, but I think
that they really could do it].  Perhaps an ELO of 3500.

A machine like that would simply be unbeatable.  It could make strategic plans.
It could analyze every move that has ever been played to a depth of 20 plies and
store it in a database.  Such a computing device would be invincible.



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.