Computer chess: Difference between revisions

Content deleted Content added
m
Curps (talk | contribs)
No edit summary
Line 24:
 
On the other hand, it remained an open question whether any amount of brute force computation would ever be adequate to defeat the expertise of top humans.
In [[1968]], IM [[David Levy (chess)|David Levy]] made a famous bet that no chess computer would be able to beat him within ten years. He won his bet in [[1978]] by beating [[Chess 4.7]] (the strongest computer at the time), but acknowledged then that it would not be long before he would be surpassed. It is well that Levy didn't renew his bet for another ten years, because in [[1989]] he was crushed by the computer [[Deep Thought]] in an exhibition match, and would probably have lost even to earlier, lesser computers.
 
Deep Thought, however, was still considerably below World Championship Level, as the then reigning world champion [[Gary Kasparov]] demonstrated in two sterling wins in [[1989]]. It wasn't until a [[1996]] match with [[International Business Machines|IBM]]'s [[Deep Blue]] that Kasparov lost his first game to a computer at tournament time controls in [[Deep Blue - Kasparov, 1996, Game 1]]. This game was, in fact, the first time a reigning world champion had lost to a computer using regular time controls. However, Kasparov regrouped to win three and draw two of the remaining five games of the match, for a convincing victory.
Line 148:
Well-known computer chess theorists include:
* [[D.F. Beal]]
* [[David Levy (chess)|David Levy]]
 
== The future of computer chess? ==