Kasparov versus Deep Blue

Name: Kasparov versus Deep Blue
Author: Monty Newborn
ISBN: 9781461274773

by Monty Newborn (1997)

Read Free Sample Buy on Amazon Audible Free Trial

About this book

In February 1996, a chess-playing computer known as Deep Blue made history by defeating the reigning world chess champion, Gary Kasparov, in a game played under match conditions. Kasparov went on to win the six-game match 4-2 and at the end of the match announced that he believed that chess computing had come of age. This book provides an enthralling account of the match and of the story that lies behind it: the evolution of chess-playing computers and the development of Deep Blue. The story of chess-playing computers goes back a long way and the author provides a whistlestop tour of the highlights of this history. As the development comes to its culmination in Philadelphia, we meet the Deep Blue team, Garry Kasparov and each of the historic six games is provided in full with a detailed commentary. Chess grandmaster Yasser Seirawan provided a lively commentary throughout the match and here provides a Foreword about the significance of this event.

Setting / LocationGlobal

Story EraModern Era

Protagonist / CoreKasparov versus Deep Blue Lead Character

Themes & Moods

Science & Technology Computer science Kasparov, g. k. (garri kimovich), 1963-Computer chess Modern Era

Readers who enjoyed this also loved

Research and Development in Intelligent Systems XXIX

Max Bramer, Miltos Petridis

The papers in this volume are the refereed papers presented at AI-2012, the Thirty-second SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence, held in Cambridge in December 2012 in both the technical and the application streams.They present new and innovative developments and applications, divided into technical stream sections on Data Mining, Data Mining and Machine Learning, Planning and Optimisation, and Knowledge Management and Prediction, followed by application stream sections on Language and Classification, Recommendation, Practical Applications and Systems, and Data Mining and Machine Learning. The volume also includes the text of short papers presented as posters at the conference.This is the twenty-ninth volume in the Research and Development in Intelligent Systems series, which also incorporates the twentieth volume in the Applications and Innovations in Intelligent Systems series. These series are essential reading for those who wish to keep up to date with developments in this important field.

Design Patterns

Erich Gamma [and others

Four software designers present a catalog of simple and succinct solutions to commonly occurring design problems, using Smalltalk and C++ in example code. These 23 patterns allow designers to create more flexible, elegant, and ultimately reusable designs without having to rediscover the design solutions themselves. The authors begin by describing what patterns are and how they can help you design object-oriented software. They go on to systematically name, explain, evaluate, and catalog recurring designs in object-oriented systems.

Communication Systems

Lyman Chapin

Communication Systems: The State of the Art captures the depth and breadth of the field of communication systems: -Architectures and Protocols for Distributed Systems; -Network and Internetwork Architectures; -Performance of Communication Systems; -Internet Applications Engineering; -Management of Networks and Distributed Systems; -Smart Networks; -Wireless Communications; -Communication Systems for Developing Countries; -Photonic Networking; -Communication Systems in Electronic Commerce. This volume's scope and authority present a rare opportunity for people in many different fields to gain a practical understanding of where the leading edge in communication systems lies today-and where it will be tomorrow.

Programming with constraints

Kim Marriott and Peter J. Stuckey

A comprehensive, self-contained introduction to constraint programming, in which programs are represented as relational equations between values and variables, and execution consists of assigning values to the variables that maintain the relational equations.