DOCSLIB.ORG

Beyond Deep Blue Chess in the Stratosphere

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Beyond Deep Blue Chess in the Stratosphere M. Newborn Beyond Deep Blue Chess in the Stratosphere ▶ The only book covering the field of computer chess since the Deep Blue versus Kasparov matches ▶ Describes the latest developments in artificial intelligence for computer chess ▶ Presents a total of 118 games, played by 17 different chess engines ▶ Details the processor speeds, memory sizes, and the number of processors used by each chess engine ▶ Presents a thorough historical summary from 1997 to the present day 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. Following Deep Blue’s retirement, there has been a succession of better and better chess playing computers, or 2011, XII, 287 p. chess engines, and today there is little question that the world’s best engines are stronger at the game than the world’s best human players. Printed book Beyond Deep Blue: Chess in the Stratosphere tells the continuing story of the chess engine and its steady improvement from its victory over Garry Kasparov to ever-greater Hardcover heights. The book provides analysis of the games alongside a detailed examination of the ▶ 59,99 € | £47.99 | $79.99 remarkable technological progress made by the engines – asking the questions which one ▶ *64,19 € (D) | 65,99 € (A) | CHF 71.00 is best, how good is it, and how much better can it get. eBook • Presents a total of 118 games, played by 17 different chess engines, collected together for the first time in a single reference Available from your bookstore or • Details the processor speeds, memory sizes, and the number of processors used by each ▶ springer.com/shop chess engine • Reviews Deep Blue’s matches with Garry Kasparov in 1996 and 1997 MyCopy • Includes games from 10 World Computer Chess Championships, and the three most recent major computer chess tournaments of the Internet Chess Club Printed eBook for just • Covers the man-machine matches between Fritz and Kramnik in 2002 and 2006, and ▶ € | $ 24.99 between Kasparov and Deep Junior in 2003 ▶ springer.com/mycopy • Describes three historical matches between leading engines: Hydra versus Shredder, Junior versus Fritz, and Zappa versus Rybka This fascinating account of the ongoing evolution of computer chess will appeal to both the general reader and to specialists in A.I. and computing. Chess players and aficionados will also appreciate this remarkable insight into the new superstars of the classic game. Dr. Order online at springer.com ▶ or for the Americas call (toll free) 1-800-SPRINGER ▶ or email us at: [email protected]. ▶ For outside the Americas call +49 (0) 6221-345-4301 ▶ or email us at: [email protected]. The first € price and the £ and $ price are net prices, subject to local VAT. Prices indicated with * include VAT for books; the €(D) includes 7% for Germany, the €(A) includes 10% for Austria. Prices indicated with ** include VAT for electronic products; 19% for Germany, 20% for Austria. All prices exclusive of carriage charges. Prices and other details are subject to change without notice. All errors and omissions excepted..
Load more

Recommended publications
  • The Check Is in the Mail June 2007
    The Check Is in the Mail June 2007 NOTICE: I will be out of the office from June 16 through June 25 to teach at Castle Chess Camp in Atlanta, Georgia. During that GM Cesar Augusto Blanco-Gramajo time I will be unable to answer any of your email, US mail, telephone calls, or GAME OF THE MONTH any other form of communication. Cesar’s provisional USCF rating is 2463. NOTICE #2 As you watch this game unfold, you can The email address for USCF almost see Blanco’s rating go upwards. correspondence chess matters has changed to [email protected] RUY LOPEZ (C67) White: Cesar Blanco (2463) ICCF GRANDMASTER in 2006 Black: Benjamin Coraretti (0000) ELECTRONIC KNIGHTS 2006 Electronic Knights Cesar Augusto Blanco-Gramajo, born 1.e4 e5 2.Nf3 Nc6 3.Bb5 Nf6 4.0–0 January 14, 1959, is a Guatemalan ICCF Nxe4 5.d4 Nd6 6.Bxc6 dxc6 7.dxe5 Grandmaster now living in the US and Ne4 participating in the 2006 Electronic An unusual sideline that seems to be Knights. Cesar has had an active career gaining in popularity lately. in ICCF (playing over 800 games there) and sports a 2562 ICCF rating along 8.Qe2 with the GM title which was awarded to him at the ICCF Congress in Ostrava in White chooses to play the middlegame 2003. He took part in the great Rest of as opposed to the endgame after 8. the World vs. Russia match, holding Qxd8+. With an unstable Black Knight down Eleventh Board and making two and quick occupancy of the d-file, draws against his Russian opponent.
    [Show full text]
  • Draft – Not for Circulation
    A Gross Miscarriage of Justice in Computer Chess by Dr. Søren Riis Introduction In June 2011 it was widely reported in the global media that the International Computer Games Association (ICGA) had found chess programmer International Master Vasik Rajlich in breach of the ICGA‟s annual World Computer Chess Championship (WCCC) tournament rule related to program originality. In the ICGA‟s accompanying report it was asserted that Rajlich‟s chess program Rybka contained “plagiarized” code from Fruit, a program authored by Fabien Letouzey of France. Some of the headlines reporting the charges and ruling in the media were “Computer Chess Champion Caught Injecting Performance-Enhancing Code”, “Computer Chess Reels from Biggest Sporting Scandal Since Ben Johnson” and “Czech Mate, Mr. Cheat”, accompanied by a photo of Rajlich and his wife at their wedding. In response, Rajlich claimed complete innocence and made it clear that he found the ICGA‟s investigatory process and conclusions to be biased and unprofessional, and the charges baseless and unworthy. He refused to be drawn into a protracted dispute with his accusers or mount a comprehensive defense. This article re-examines the case. With the support of an extensive technical report by Ed Schröder, author of chess program Rebel (World Computer Chess champion in 1991 and 1992) as well as support in the form of unpublished notes from chess programmer Sven Schüle, I argue that the ICGA‟s findings were misleading and its ruling lacked any sense of proportion. The purpose of this paper is to defend the reputation of Vasik Rajlich, whose innovative and influential program Rybka was in the vanguard of a mid-decade paradigm change within the computer chess community.
    [Show full text]
  • Move Similarity Analysis in Chess Programs
    Move similarity analysis in chess programs D. Dailey, A. Hair, M. Watkins Abstract In June 2011, the International Computer Games Association (ICGA) disqual- ified Vasik Rajlich and his Rybka chess program for plagiarism and breaking their rules on originality in their events from 2006-10. One primary basis for this came from a painstaking code comparison, using the source code of Fruit and the object code of Rybka, which found the selection of evaluation features in the programs to be almost the same, much more than expected by chance. In his brief defense, Rajlich indicated his opinion that move similarity testing was a superior method of detecting misappropriated entries. Later commentary by both Rajlich and his defenders reiterated the same, and indeed the ICGA Rules themselves specify move similarity as an example reason for why the tournament director would have warrant to request a source code examination. We report on data obtained from move-similarity testing. The principal dataset here consists of over 8000 positions and nearly 100 independent engines. We comment on such issues as: the robustness of the methods (upon modifying the experimental conditions), whether strong engines tend to play more similarly than weak ones, and the observed Fruit/Rybka move-similarity data. 1. History and background on derivative programs in computer chess Computer chess has seen a number of derivative programs over the years. One of the first was the incident in the 1989 World Microcomputer Chess Cham- pionship (WMCCC), in which Quickstep was disqualified due to the program being \a copy of the program Mephisto Almeria" in all important areas.
    [Show full text]
  • New Architectures in Computer Chess Ii New Architectures in Computer Chess
    New Architectures in Computer Chess ii New Architectures in Computer Chess PROEFSCHRIFT ter verkrijging van de graad van doctor aan de Universiteit van Tilburg, op gezag van de rector magnificus, prof. dr. Ph. Eijlander, in het openbaar te verdedigen ten overstaan van een door het college voor promoties aangewezen commissie in de aula van de Universiteit op woensdag 17 juni 2009 om 10.15 uur door Fritz Max Heinrich Reul geboren op 30 september 1977 te Hanau, Duitsland Promotor: Prof. dr. H.J.vandenHerik Copromotor: Dr. ir. J.W.H.M. Uiterwijk Promotiecommissie: Prof. dr. A.P.J. van den Bosch Prof. dr. A. de Bruin Prof. dr. H.C. Bunt Prof. dr. A.J. van Zanten Dr. U. Lorenz Dr. A. Plaat Dissertation Series No. 2009-16 The research reported in this thesis has been carried out under the auspices of SIKS, the Dutch Research School for Information and Knowledge Systems. ISBN 9789490122249 Printed by Gildeprint © 2009 Fritz M.H. Reul All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronically, mechanically, photocopying, recording or otherwise, without prior permission of the author. Preface About five years ago I completed my diploma project about computer chess at the University of Applied Sciences in Friedberg, Germany. Immediately after- wards I continued in 2004 with the R&D of my computer-chess engine Loop. In 2005 I started my Ph.D. project ”New Architectures in Computer Chess” at the Maastricht University. In the first year of my R&D I concentrated on the redesign of a computer-chess architecture for 32-bit computer environments.
    [Show full text]
  • A Proposed Heuristic for a Computer Chess Program
    A Proposed Heuristic for a Computer Chess Program copyright (c) 2013 John L. Jerz [email protected] Fairfax, Virginia Independent Scholar MS Systems Engineering, Virginia Tech, 2000 MS Electrical Engineering, Virginia Tech, 1995 BS Electrical Engineering, Virginia Tech, 1988 December 31, 2013 Abstract How might we manage the attention of a computer chess program in order to play a stronger positional game of chess? A new heuristic is proposed, based in part on the Weick organizing model. We evaluate the 'health' of a game position from a Systems perspective, using a dynamic model of the interaction of the pieces. The identification and management of stressors and the construction of resilient positions allow effective postponements for less-promising game continuations due to the perceived presence of adaptive capacity and sustainable development. We calculate and maintain a database of potential mobility for each chess piece 3 moves into the future, for each position we evaluate. We determine the likely restrictions placed on the future mobility of the pieces based on the attack paths of the lower-valued enemy pieces. Knowledge is derived from Foucault's and Znosko-Borovsky's conceptions of dynamic power relations. We develop coherent strategic scenarios based on guidance obtained from the vital Vickers/Bossel/Max- Neef diagnostic indicators. Archer's pragmatic 'internal conversation' provides the mechanism for our artificially intelligent thought process. Initial but incomplete results are presented. keywords: complexity, chess, game
    [Show full text]
  • A Chess Engine
    A Chess Engine Paul Dailly Dominik Gotojuch Neil Henning Keir Lawson Alec Macdonald Tamerlan Tajaddinov University of Glasgow Department of Computing Science Sir Alwyn Williams Building Lilybank Gardens Glasgow G12 8QQ March 18, 2008 Abstract Though many computer chess engines are available, the number of engines using object orientated approaches to the problem is minimal. This report documents an implementation of an object oriented chess engine. Traditionally, in order to gain the advantage of speed, the C language is used for implementation, however, being an older language, it lacks many modern language features. The chess engine documented within this report uses the modern Java language, providing features such as reflection and generics that are used extensively, allowing for complex but understandable code. Also of interest are the various depth first search algorithms used to produce a fast game, and the numerous functions for evaluating different characteristics of the board. These two fundamental components, the evaluator and the analyser, combine to produce a fast and relatively skillful chess engine. We discuss both the design and implementation of the engine, along with details of other approaches that could be taken, and in what manner the engine could be expanded. We conclude by examining the engine empirically, and from this evaluation, reflecting on the advantages and disadvantages of our chosen approach. Education Use Consent We hereby give our permission for this project to be shown to other University of Glasgow students and to be distributed in an electronic format. Please note that you are under no obligation to sign this declaration, but doing so would help future students.
    [Show full text]
  • Rybka Investigation and Summary of Findings for the ICGA Mark Lefler, Robert Hyatt, Harvey Williamson and ICGA Panel Members 12 May 2011
    Rybka Investigation and Summary of Findings for the ICGA Mark Lefler, Robert Hyatt, Harvey Williamson and ICGA panel members 12 May 2011 1. Background 1.1 Purpose: To investigate claims that the chess playing program Rybka is a derivative of the chess programs Fruit and Crafty and violated International Computer Games Association (ICGA) Tournament rules. Rybka is a program by Vasik Rajlich. Fruit was written by Fabien Letouzey. Crafty was written by Robert Hyatt. 1.2 Allegations. Allegations have surfaced that Rybka 1.0 beta and later versions are derivatives of Fruit 2.1. Fruit 2.1 source code was distributed with a specific license in the copying.txt file. Part of this license reads: "For example, if you distribute copies of such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights." Allegations point out that by distributing Rybka, if it is based on Fruit, this GNU license was violated (http://icga.wikispaces.com/Open+letter+to+the+ICGA+about+the+Rybka- Fruit+issue). If versions of Rybka are derived from Fruit and participated in ICGA tournaments, then Rybka has also violated ICGA Tournament Rules. Specifically, the rules state: "Each program must be the original work of the entering developers. Programming teams whose code is derived from or including game-playing code written by others must name all other authors, or the source of such code, in the details of their submission form.
    [Show full text]
  • Beyond the 3000 Elo Barrier a Glance Behind the Scenes of the Rybka Chess Engine by HARALD FIETZ
    Beyond the 3000 Elo barrier A glance behind the scenes of the Rybka chess engine by HARALD FIETZ t the end of 2005, the worked in the computer field. My looked very promising and scary for world of chess computers mother is also a trained mathematician. the opponent when I played them, but suddenly changed when an I have two younger brothers. We moved in a post-mortem Rybka sometimes engine with the name back to Prague when I was three weeks revealed them as crazy blunders. I A of Rybka appeared from old and stayed in the Czech Republic believe that using Rybka can help to virtually nowhere. At the prestigious until I was 11 The whole family develop an intuition about which International Paderborn Computer moved back to the USA at that time. I sacrifices actually work. For sure using Chess Championship the new program studied computer science at MIT Rybka has some influence on my by the American developer Vaclav (Massachusetts Institute of Technology) openings – I think that my repertoire is Rajlich – whom everybody simply calls near Boston and worked as a software getting much stronger thanks to my Vasik or Vas as his first name – won developer at Texas Instruments (Dallas, work with the engine.” a clear point ahead of established USA), Triada, a company specialized in machines such as Zappa, Spike, data compression, (Ypsilanti, USA), A programmer’s everyday life Shredder, Fruit or Jonny. Out of the Ford (Detroit, USA), at the Environ- and visions blue, Rybka skyrocketed to the top of mental Research Institute of Michigan, the Swedish computer rating list, which was developing radar imaging However, the improvement of a which had been regarded for a long systems (Ann Arbor, USA), and Option, sophisticated program also requires a time as the equivalent of the FIDE a leading company in the field of lot of support from other sources: rating list in the chess computer sector wireless communication technology “There are tons of people who are (cp.http://web.telia.com/~u85924109/ss (Adelsried, Germany), over the last involved in the project in various ways.
    [Show full text]
  • Today LONDON NEWS, GLOBAL VIEWS
    KENSINGTON CHELSEA & WESTMINSTER, HAMMERSMITH & FULHAM kcwAND OTHER SELECT LONDON BOROUGHStoday LONDON NEWS, GLOBAL VIEWS ISSUE 0068 DECEMBER/JANUARY 2017/18 FREE NEWS POLITICS BUSINESS & FINANCE OPINION EDUCATION ARTS & CULTUREBENJAMIN EVENTS FRANKLIN LIFESTYLE DINING OUT POETRY LITERATURE MOTORING SPORT CROSSWORD BRIDGE CHESS 2 December 2017/January 2018 Kensington, Chelsea & Westminster Today www.KCWToday.co.uk Contents & Offices Kensington, Chelsea KENSINGTON CHELSEA & WESTMINSTER, HAMMERSMITH & FULHAM AND OTHER SELECT LONDON BOROUGHS & Westminster Today kcwtoday Contents LONDON NEWS, GLOBAL VIEWS ISSUE 0067 NOVEMBER 2017 FREE EDUCATION 80-100 Gwynne Road, London, BUSINESS & FINANCE EVENTS SW11 3UW SUPPLEMENTS NEWS Tel: 020 7738 2348 POLITICS OPINION LIFESTYLE DINING OUT ARTS & CULTURE POETRY E-mail: [email protected] LITERATURE MOTORING Website: SPORT News CROSSWORD 3 BRIDGE www.kcwtoday.co.uk CHESS Advertisement enquiries: [email protected] 11 Statue & Blue Plaque Subscriptions: [email protected] BENJAMIN FRANKLIN Publishers: THE TREE OF KNOWLEDGE Opinion & Comment Kensington & Chelsea Today Limited 12 14 Features 16 Business & Finance Editor-in-Chief: Kate Hawthorne Art Director & Director: Tim Epps 21 Astronomy Editors : Kate Hawthorne, Emma Trehane Head of Business Development: Emma Trehane Business Development: Caroline Daggett, 22 Education Antoinette Kovatchka, Architecture: Squinch Art & Culture Editors: Don Grant, Marian Maitland 26 Literature Astronomy: Scott Beadle FRAS Ballet/Dance: Andrew Ward Bridge:
    [Show full text]
  • Table of Contents
    TABLE OF CONTENTS Table of Contents ......................................................................................................................................................181 Overchampion (H.J. van den Herik) ........................................................................................................................181 Welcome and Farewell (Editor)................................................................................................................................182 A New Heuristic Search Algorithm for Capturing Problems in Go (K. Chen and P. Zhang) ................................183 New Approximate Strategies for Playing Sum Games based on Subgame Types (M.M. Zaky, C.R.S. Andraos, and S.A. Ghoneim).....................................................................................................................................191 Notes: ............................................................................................................................................................ 199 On the Importance of Embracing Risk in Tournaments (D. Billings) ................................................ 199 Nim is Easy, Chess is Hard – But Why?? (A. Fraenkel)..................................................................... 203 Information for Contributors............................................................................................................................. 207 News, Information, Tournaments, and Reports: ................................................................................................
    [Show full text]
  • The Chess Monster Hydra
    The Chess Monster Hydra Chrilly Donninger and Ulf Lorenz Universität Paderborn, Faculty of Computer Science, Electrical Engineering and Mathematics Fürstenallee 11, D-33102 Paderborn Abstract. With the help of the FPGA technology, the boarder between hard- and software has vanished. It is now possible to develop complex designs and fine grained parallel applications without the long-lasting chip design cycles. Ad- ditionally, it has become easier to write coarse grained parallel applications with the help of message passing libraries like MPI. The chess program Hydra is a high level hardware-software co-design application which profits from both worlds. We describe the design philosophy, general architecture and performance of Hy- dra. The time critical part of the search tree, near the leaves, is explored with the help of fine grain parallelism of FPGA cards. For nodes near the root, the search algorithm runs distributed on a cluster of conventional processors. A nice detail is that the FPGA cards allow the implementation of sophisticated chess knowledge without decreasing the computational speed. 1 Introduction The early chess programs tried to mimic the human chess style. In the 1970s Chess 4.5 [7], however, demonstrated that emphasizing the search speed might be more fruit- ful. Belle[1], Cray Blitz, Hitech, and Deep Thought[4] were the top programs in the 1980s. From 1992 on, PCs dominated the world of computer chess: ChessMachine, Fritz, Shredder etc. With one well known exception: In 1997, IBM’s Deep Blue[3] won the historical 6-game match against Garry Kasparov. This highlight is still of singu- lar quality, although the playing strengths of present top programs seem to cross the borderline beyond the strongest human players.
    [Show full text]
  • Table of Contents 65
    Table of Contents 65 TABLE OF CONTENTS Table of Contents ........................................................................................................................................................ 65 The End of an Era (H.J. van den Herik) .................................................................................................................... 65 Comparing Move Choices of Chess Search Engines (M. Levene and J. Bar-Ilan)................................................... 67 An Optimistic Pondering Approach for Asynchronous Distributed Game-Tree Search (K. Himstedt)................... 77 The Nature of Retrograde Analysis for Chinese Chess - Part 1 (H-r. Fang) ............................................................. 91 Information for Contributors.....................................................................................................................................106 News, Information, Tournaments, and Reports:.......................................................................................................107 Adams Outclassed by HYDRA (ChessBase, the Editor, J. Nunn, and D. Levy)........................................107 Man vs. Machine – What Next? (D. Levy) ..............................................................................................111 Computers Outsmart Indonesian Players (ChessBase) .............................................................................112 The 5th International Open CSVN Tournament (Th. van der Storm) .......................................................114
    [Show full text]