To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

Deep Thought (chess computer)

From Wikipedia, the free encyclopedia

Deep Thought was a computer designed to play chess. Deep Thought was initially developed at Carnegie Mellon University and later at IBM.[1] It was second in the line of chess computers developed by Feng-hsiung Hsu, starting with ChipTest and culminating in Deep Blue. In addition to Hsu, the Deep Thought team included Thomas Anantharaman, Mike Browne, Murray Campbell and Andreas Nowatzyk.[2] Deep Thought became the first computer to beat a grandmaster in a regular tournament game when it beat Bent Larsen in 1988,[2] but was easily defeated in both games of a two-game match with Garry Kasparov in 1989 as well as in a correspondence match with Michael Valvo.

It was named after Deep Thought, a fictional computer in Douglas Adams' series, The Hitchhiker's Guide to the Galaxy. The naming of chess computers has continued in this vein with Deep Blue, Deep Fritz, Deep Junior, etc.

Deep Thought won the North American Computer Chess Championship in 1988 and the World Computer Chess Championship in the year 1989, and its rating, according to the USCF was 2551.[2] In 1994, Deep Thought 2 won the North American Computer Chess Championship for the fifth time, with its rating estimated at around 2600. It was sponsored by IBM. Some engineers who designed Deep Thought also worked in the design of Deep Thought 2. Its algorithms were quite simple evaluation functions, but it could examine half a billion chess positions per move in tournament games, which is sufficient to reach depth of 10 or 11 moves ahead in complex positions. Despite that, using the technique of singular extensions it could also follow lines of forced moves that reach even further, which is how it once found a checkmate in 18 moves.[citation needed]

YouTube Encyclopedic

  • 1/3
    Views:
    341 271
    16 600
    143 302
  • Deep Blue vs. Kasparov 1996 Game 1
  • How Do Chess Computers Think?
  • Kasparov vs Deep Blue - Real time Commentary by GM Yasser Seirawan (1997)

Transcription

See also

Notes

  1. ^ "History of deep blue". IBM. 7 March 2012. Retrieved 27 February 2016.
  2. ^ a b c Hans Berliner (1989). "Deep Thought wins the $10,000 Fredkin Prize" (PDF). AI Magazine Volume 10 Number 2. Retrieved 27 February 2016.

References

External links

This page was last edited on 22 July 2023, at 18:42
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.