50,28 €
inkl. MwSt.
Sofort per Download lieferbar
  • Format: PDF

More than a decade has passed since IBM’s Deep Blue computer stunned the world by defeating Garry Kasparov, the world chess champion at that time. Beyond Deep Blue tells the continuing story of the chess engine and its steady improvement. The book provides analysis of the games alongside a detailed examination of the remarkable technological progress made by the engines – asking which one is best, how good is it, and how much better can it get. Features: presents a total of 118 games, played by 17 different chess engines, collected together for the first time in a single reference; details the…mehr

Produktbeschreibung
More than a decade has passed since IBM’s Deep Blue computer stunned the world by defeating Garry Kasparov, the world chess champion at that time. Beyond Deep Blue tells the continuing story of the chess engine and its steady improvement. The book provides analysis of the games alongside a detailed examination of the remarkable technological progress made by the engines – asking which one is best, how good is it, and how much better can it get. Features: presents a total of 118 games, played by 17 different chess engines, collected together for the first time in a single reference; details the processor speeds, memory sizes, and the number of processors used by each chess engine; includes games from 10 World Computer Chess Championships, and three computer chess tournaments of the Internet Chess Club; covers the man-machine matches between Fritz and Kramnik, and Kasparov and Deep Junior; describes three historical matches between leading engines – Hydra vs. Shredder, Junior vs. Fritz, and Zappa vs. Rybka.
Rezensionen
From the reviews:
"Newborn's new book Beyond Deep Blue ... includes 118 games played by seventeen different chess engines from Kasparov's matches with Deep Blue in 1996 and 1997 up to the 2010 world computer championship. ... This is a book primarily for computer scientists but one that chess players are also likely to find of interest." (ChessCafe, August, 2011)