DOCSLIB.ORG

{Download PDF} Kasparov Versus Deep Blue : Computer Chess

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
{Download PDF} Kasparov Versus Deep Blue : Computer Chess KASPAROV VERSUS DEEP BLUE : COMPUTER CHESS COMES OF AGE PDF, EPUB, EBOOK Monty Newborn | 322 pages | 31 Jul 2012 | Springer-Verlag New York Inc. | 9781461274773 | English | New York, NY, United States Kasparov versus Deep Blue : Computer Chess Comes of Age PDF Book In terms of human comparison, the already existing hierarchy of rated chess players throughout the world gave engineers a scale with which to easily and accurately measure the success of their machine. This was the position on the board after 35 moves. Nxh5 Nd2 Kg4 Bc7 Famously, the mechanical Turk developed in thrilled and confounded luminaries as notable as Napoleon Bonaparte and Benjamin Franklin. Kf1 Bc3 Deep Blue. The only reason Deep Blue played in that way, as was later revealed, was because that very same day of the game the creators of Deep Blue had inputted the variation into the opening database. KevinC The allegation was that a grandmaster, presumably a top rival, had been behind the move. When it's in the open, anyone could respond to them, including people who do understand them. Qe2 Qd8 Bf3 Nd3 IBM Research. Nearly two decades later, the match still fascinates This week Time Magazine ran a story on the famous series of matches between IBM's supercomputer and Garry Kasparov. Because once you have an agenda, where does indifference fit into the picture? Raa6 Ba7 Black would have acquired strong counterplay. In fact, the first move I looked at was the immediate 36 Be4, but in a game, for the same safety-first reasons the black counterplay with a5 I might well have opted for 36 axb5. Qxb7 Nxe5 Show 0 comments. It was also a major sporting event. The problem was that the communication between the chips was slow and used up a lot of processing power. Retrieved February 9, However, computer chess remains an imperfect system, at least when it comes to human learning. Retrieved April 19, Access from your library This is a preview. Editors' Picks Features Explore Contribute. Qh5 Qh8 Simon Williams shows his favorite opening traps in 60 minutes. From: Science Vol. Bg5 Be7 9. Special: AVRO Ke3 e5 Kasparov versus Deep Blue : Computer Chess Comes of Age Writer Qc3 f5 Source Citation McCarthy, John. After 50 years of research and development in conjunction with artificial intelligence, the study of computer chess culminated during two matches between Deep Blue, a chess supercomputer funded by IBM, and the Chess World Champion Garry Kasparov. Bh3 Qc7 Nevertheless, even the most stubborn artificial intelligence expert recognizes Deep Blue as a monumental achievement for the field, if only as a starting point. Computer Science HCI. Although Kasparov won the February match in Philadelphia, his faceless foe took the opening game in a watershed moment for artificial intelligence and 20th century technology. February The Future Pages Newborn, Monty. Clearly, some computer scientists feel that computer chess research has been fully developed, and that the field of artificial intelligence should move beyond it. Bxe7 Qxe7 A more materialistic machine could have won two pawns with Kg1 Kf8 Kasparov went on to win the six-game match and at the end of the match announced that he believed that chess computing had come of age. Bf4 Ne5 Bekijk de hele lijst. Rg1 hxg4 Rh7 Kc4 Therefore, most of the adjustments and tuning that occurs within a machine depend on human input. Rd1 Kc7 Retrieved June 29, However, as the computer is allowed to search deeper into future possible moves to determine the correct move, the technical requirements increase exponentially, limiting how far or fast a machine can search. You can find our Community Guidelines in full here. Kh4 Kg8 These values can then be processed and searched to determine the best move to make. Ng5 Bf5 Qxa7 Rb8 Qd2 Ne4 Review our Privacy Policy for more information about our privacy practices. Qa8 Qc7 Machine chess has changed the way people learn the game in a number of ways. Kasparov versus Deep Blue : Computer Chess Comes of Age Reviews Practical Chess Strategy: The Bishop When it comes to strategy, one of the key things that chess professionals understand much better than amateur players is the role of the bishop which is the key theme on this video course. It wasn't just a scientific exercise as IBM claimed it was, otherwise they would have been transparent from the beginning. Nxd5 a5 Although both players were treading in unfamiliar territory and the machine still put forth a valiant effort throughout the final two games, Kasparov proceeded to take down Deep Blue without much trouble [7]. Junior and Fritz marked a change in the approach to developing systems for computer chess. And if all goes well, I can make a computer program that acts like Mr. Or Korchnoi? Nxe4 Nd7 5. This increase of efficiency convinced many artificial intelligence scholars to follow singular extensions and its more brute force-heavy searching methodology, especially because the algorithm was highly optimized by a slight use of selective search. Rb4 1—0. Some years in the making, we finally had a machine that played a prized strategy game better than we did. Someone could just as well argue that the machine was dismantled because they wanted to exclude the possibility of having to address the controversy that they brought upon themselves, and which they failed to address. Hands-on real-world examples, research, tutorials, and cutting-edge techniques delivered Monday to Thursday. Re2 Nf5 Rxe7 Bxe7 But Deep Thought hit a road block later that year when it came up against and lost to the reigning world chess champion, one Garry Kasparov. To help us offer and evaluate relevant content and interesting and appropriate advertisement. Qb6 Rd8 Kasparov states he was able to analyze Deep Blues previous games before the match, but not for the match. Rc3 Bc4 The game started with the Ruy Lopez opening, Smyslov Variation. Deep Blue's 44th move in this game was allegedly the result of a bug in which Deep Blue, unable to determine a desirable move, resorted to a fail-safe. Related Posts. Bean and put all the ideas into code. Cheating with a grandmaster? PaulPena I think you hit the nail on the head with that comment. Kasparov versus Deep Blue : Computer Chess Comes of Age Read Online Nce2 Rxg4 Qd5 Qe6 Although clearly shaken by the early loss, Kasparov rebounded capably, eventually winning the entire match by a score of four games to two [6]. Sign in. Bg5 Be7 Compiling Chess Strategy The main focus of artificial intelligence research in chess is the use of strategy that defines the game. The move left Kasparov riled and ultimately thrown off his strategy. Chess News. During the first four games of the match, the world champion played the style he had perfected against human opponents in hundreds of games, employing his well-known game openings to begin each game. Perhaps years from now, someone involved with IBM's team may come forward and offer a story that conflicts with the accepted history. Certainly back in Namespaces Article Talk. They used brute force in analysing very large numbers of moves rather than focusing on certain types of move they already knew were most likely to work. Coaches use software to help analyze the games of their students and trainees. The debate began as early as the s, when Claude Shannon, the Boolean logic pioneer, introduced two different search algorithms to implement in computer chess: selective search and brute force search. Re1 Nd5 Kasparov eventually resigned, although post-game analysis indicates that he could have held a draw in the final position. We made some changes between games, which was allowed by the rules just as people are allowed to do. Bc5 Bf8 Nxb7 Ne5 Kf1 Rb8 In essence there is no difference between chess programming then and chess programming now. A fierce critic of Russian President Vladimir Putin, he played an active role in the anti-Kremlin opposition protest movement when he lived in Moscow and even tried to run for the presidency. Strong arguments have been made for both sides by prominent experts in the fields, and the fate of future computer chess studies hangs in the balance. Re1 Nf4 Ra6 1—0. Kd3 Rd8 Reply Delete 0 0. These researchers saw in the structure of chess a simplified model for large-scale problem solving. Download as PDF Printable version. Kd4 Kf5 Bb8 Ra4 By the time Deep Blue defeated Mr. Ka1 Qxe3 Let's start with respect. For instance, a programmer is not required to do the same as what programmers did back in the 90's, because back in the 90's, techniques were far less refined than they are today. Kasparov went on to win the six-game match and at the end of the match announced that he believed that chess computing had come of age. In particular they showed the capabilities of a general- purpose computer system that controlled a large number of custom chips designed for a specific application. Why wasn't it likely, according to me? Read this book on SpringerLink. Bd3 Bd6 7. This was the position on the board after 35 moves. https://cdn.starwebserver.se/shops/razmusblomqvistao/files/read-and-share-bible-over-200-best-loved-bible-stories-328.pdf https://files8.webydo.com/9583290/UploadedFiles/3974CF9F-2DB7-F032-8992-E068CE2E9952.pdf https://files8.webydo.com/9582877/UploadedFiles/82ED902A-084D-759A-DD6E-D12FAA5BD2B3.pdf https://files8.webydo.com/9582764/UploadedFiles/5910038D-47B5-3FB4-48AA-EAC6A5F344B7.pdf https://files8.webydo.com/9583395/UploadedFiles/D83877AF-E974-5DB2-F10F-9C7164EA79CE.pdf https://files8.webydo.com/9582912/UploadedFiles/CB23ED51-3DC0-B2C9-13F5-483782DF7CDF.pdf https://files8.webydo.com/9583373/UploadedFiles/15837F5E-4E50-CD08-5C1B-7B0C4FB370E0.pdf https://files8.webydo.com/9583458/UploadedFiles/2FBB58C1-19FC-EF9C-DA77-2013934877D1.pdf.
Load more

Recommended publications
  • Deep Fritz 11 Rating
    Deep fritz 11 rating CCRL 40/4 main list: Fritz 11 has no rank with rating of Elo points (+9 -9), Deep Shredder 12 bit (+=18) + 0 = = 0 = 1 0 1 = = = 0 0 = 0 = = 1 = = 1 = = 0 = = 0 1 0 = 0 1 = = 1 1 = – Deep Sjeng WC bit 4CPU, , +12 −13, (−65), 24 − 13 (+13−2=22). %. This is one of the 15 Fritz versions we tested: Compare them! . − – Deep Sjeng bit, , +22 −22, (−15), 19 − 15 (+13−9=12). % / Complete rating list. CCRL 40/40 Rating List — All engines (Quote). Ponder off Deep Fritz 11 4CPU, , +29, −29, %, −, %, %. Second on the list is Deep Fritz 11 on the same hardware, points below The rating list is compiled by a Swedish group on the basis of. Fritz is a German chess program developed by Vasik Rajlich and published by ChessBase. Deep Fritz 11 is eighth on the same list, with a rating of Overall the answer for what to get is depending on the rating Since I don't have Rybka and I do have Deep Fritz 11, I'll vote for game vs Fritz using Opening or a position? - Chess. Find helpful customer reviews and review ratings for Fritz 11 Chess Playing Software for PC at There are some algorithms, from Deep fritz I have a small Engine Match database and use the Fritz 11 Rating Feature. Could somebody please explain the logic behind the algorithm? Chess games of Deep Fritz (Computer), career statistics, famous victories, opening repertoire, PGN download, Feb Version, Cores, Rating, Rank. DEEP Rybka playing against Fritz 11 SE using Chessbase We expect, that not only the rating figures, but also the number of games and the 27, Deep Fritz 11 2GB Q 2,4 GHz, , 18, , , 62%, Deep Fritz.
    [Show full text]
  • Regulations for the FIDE World Chess Cup 2017 2. Qualifying Events for World Cup 2017
    Regulations for the FIDE World Chess Cup 2017 1. Organisation 1.1 The FIDE World Chess Cup (World Cup) is an integral part of the World Championship Cycle 2016-2018. 1.2 Governing Body: the World Chess Federation (FIDE). For the purpose of creating the regulations, communicating with the players and negotiating with the organisers, the FIDE President has nominated a committee, hereby called the FIDE Commission for World Championships and Olympiads (hereinafter referred to as WCOC) 1.3 FIDE, or its appointed commercial agency, retains all commercial and media rights of the World Chess Cup 2017, including internet rights. 1.4 Upon recommendation by the WCOC, the body responsible for any changes to these Regulations is the FIDE Presidential Board. 2. Qualifying Events for World Cup 2017 2. 1. National Chess Championships - National Chess Championships are the responsibility of the Federations who retain all rights in their internal competitions. 2. 2. Zonal Tournaments - Zonals can be organised by the Continents according to their regulations that have to be approved by the FIDE Presidential Board. 2. 3. Continental Chess Championships - The Continents, through their respective Boards and in co-operation with FIDE, shall organise Continental Chess Championships. The regulations for these events have to be approved by the FIDE Presidential Board nine months before they start if they are to be part of the qualification system of the World Chess Championship cycle. 2. 3. 1. FIDE shall guarantee a minimum grant of USD 92,000 towards the total prize fund for Continental Championships, divided among the following continents: 1. Americas 32,000 USD (minimum prize fund in total: 50,000 USD) 2.
    [Show full text]
  • View 2020 Circular
    2020 South African Junior Chess Championships 2020 Wild Card Chess Championship 2020 South Africa Junior Blitz Chess Championships 2020 South Africa Doubles Chess Championships 2020 Inter Regional Team Chess Championship 3 to 12 January 2021 Hosted by 4 Knights International Events Company CIRCULAR 1 Version 1.0 26 September 2020 Table of Contents 1. LOCAL ORGANIZING COMMITTEE (LOC) 5 1. CONVENER................................................................................................................................................. 5 2. TREASURER ................................................................................................................................................ 5 3. TECHNICAL DIRECTOR .................................................................................................................................. 5 4. CHIEF ARBITER ........................................................................................................................................... 5 5. ACCOMMODATION...................................................................................................................................... 5 6. MEDIA AND PHOTO’S .................................................................................................................................. 5 7. PUBLIC RELATIONS ...................................................................................................................................... 5 8. LOGISTICS .................................................................................................................................................
    [Show full text]
  • Learning Long-Term Chess Strategies from Databases
    Mach Learn (2006) 63:329–340 DOI 10.1007/s10994-006-6747-7 TECHNICAL NOTE Learning long-term chess strategies from databases Aleksander Sadikov · Ivan Bratko Received: March 10, 2005 / Revised: December 14, 2005 / Accepted: December 21, 2005 / Published online: 28 March 2006 Springer Science + Business Media, LLC 2006 Abstract We propose an approach to the learning of long-term plans for playing chess endgames. We assume that a computer-generated database for an endgame is available, such as the king and rook vs. king, or king and queen vs. king and rook endgame. For each position in the endgame, the database gives the “value” of the position in terms of the minimum number of moves needed by the stronger side to win given that both sides play optimally. We propose a method for automatically dividing the endgame into stages characterised by different objectives of play. For each stage of such a game plan, a stage- specific evaluation function is induced, to be used by minimax search when playing the endgame. We aim at learning playing strategies that give good insight into the principles of playing specific endgames. Games played by these strategies should resemble human expert’s play in achieving goals and subgoals reliably, but not necessarily as quickly as possible. Keywords Machine learning . Computer chess . Long-term Strategy . Chess endgames . Chess databases 1. Introduction The standard approach used in chess playing programs relies on the minimax principle, efficiently implemented by alpha-beta algorithm, plus a heuristic evaluation function. This approach has proved to work particularly well in situations in which short-term tactics are prevalent, when evaluation function can easily recognise within the search horizon the con- sequences of good or bad moves.
    [Show full text]
  • Caissa Nieuws
    rvd v CAISSA NIEUWS -,1. 374 Met een vraagtecken priJ"ken alleen die zetten, die <!-Cl'.1- logiSchcnloop der partij werkelijk ingrijpend vemol"en. Voor zichzelf·sprekende dreigingen zijn niet vermeld. · Ah, de klassieken ... april 1999 Caissanieuws 37 4 april 1999 Colofon Inhoud Redactioneel meer is, hij zegt toe uit de doeken te doen 4. Gerard analyseert de pijn. hoe je een eindspeldatabase genereert. CaïssaNieuws is het clubblad van de Wellicht is dat iets voor Ed en Leo, maar schaakvereniging Caïssa 6. Rikpareert Predrag. Dik opgericht 1-5-1951 6. Dennis komt met alle standen. verder ook voor elke Caïssaan die zijn of it is een nummer. Met een schaak­ haar spel wil verbeteren. Daar zijn we wel Clublokaal: Oranjehuis 8. Derde nipt naar zege. dik Van Ostadestraat 153 vrije avond en nog wat feestdagen in benieuwd naar. 10. Zesde langs afgrond. 1073 TKAmsterdam hetD vooruitzicht is dat wel prettig. Nog aan­ Tot slot een citaat uit de bespreking van Telefoon - clubavond: 679 55 59 dinsda_g_ 13. Maarten heeftnotatie-biljet op genamer is het te merken dat er mensen Robert Kikkert van een merkwaardig boek Voorzitter de rug. zijn die de moeite willen nemen een bij­ dat weliswaar de Grünfeld-verdediging als Frans Oranje drage aan het clubblad te leveren zonder onderwerp heeft, maar ogenschijnlijk ook Oudezijds Voorburgwal 109 C 15. Tuijl vloert Vloermans. 1012 EM Amsterdam 17. Johan ziet licht aan de horizon. dat daar om gevraagd is. Zo moet het! een ongebruikelijke visieop ons multi-culti Telefoon 020 627 70 17 18. Leo biedt opwarmertje. In deze aflevering van CN zet Gerard wereldje bevat en daarbij enpassant het we­ Wedstrijdleider interne com12etitie nauwgezet uiteen dat het beter kanen moet reldvoedselverdelingsvraagstukaan de orde Steven Kuypers 20.
    [Show full text]
  • Rules & Regulations for the Candidates Tournament of the FIDE
    Rules & regulations for the Candidates Tournament of the FIDE World Championship cycle 2016-2018 1. Organisation 1. 1 The Candidates Tournament to determine the challenger for the 2018 World Chess Championship Match shall be organised in the first quarter of 2018 and represents an integral part of the World Chess Championship regulations for the cycle 2016- 2018. Eight (8) players will participate in the Candidates Tournament and the winner qualifies for the World Chess Championship Match in the last quarter of 2018. 1. 2 Governing Body: the World Chess Federation (FIDE). For the purpose of creating the regulations, communicating with the players and negotiating with the organisers, the FIDE President has nominated a committee, hereby called the FIDE Commission for World Championships and Olympiads (hereinafter referred to as WCOC) 1. 3 FIDE, or its appointed commercial agency, retains all commercial and media rights of the Candidates Tournament, including internet rights. These rights can be transferred to the organiser upon agreement. 1. 4 Upon recommendation by the WCOC, the body responsible for any changes to these Regulations is the FIDE Presidential Board. 1. 5 At any time in the course of the application of these Regulations, any circumstances that are not covered or any unforeseen event shall be referred to the President of FIDE for final decision. 2. Qualification for the 2018 Candidates Tournament The players who qualify for the Candidates Tournament (excluding the World Champion who qualifies directly to the World Championship Match) are determined according to the following criteria, in order of priority: 2. 1 World Championship Match 2016 - The player who lost the 2016 World Championship Match qualifies.
    [Show full text]
  • Super Human Chess Engine
    SUPER HUMAN CHESS ENGINE FIDE Master / FIDE Trainer Charles Storey PGCE WORLD TOUR Young Masters Training Program SUPER HUMAN CHESS ENGINE Contents Contents .................................................................................................................................................. 1 INTRODUCTION ....................................................................................................................................... 2 Power Principles...................................................................................................................................... 4 Human Opening Book ............................................................................................................................. 5 ‘The Core’ Super Human Chess Engine 2020 ......................................................................................... 6 Acronym Algorthims that make The Storey Human Chess Engine ......................................................... 8 4Ps Prioritise Poorly Placed Pieces ................................................................................................... 10 CCTV Checks / Captures / Threats / Vulnerabilities ...................................................................... 11 CCTV 2.0 Checks / Checkmate Threats / Captures / Threats / Vulnerabilities ............................. 11 DAFiii Attack / Features / Initiative / I for tactics / Ideas (crazy) ................................................. 12 The Fruit Tree analysis process ............................................................................................................
    [Show full text]
  • Washington Open a NW Grand Prix Event May 23-25, 2020
    Washington Open A NW Grand Prix Event May 23-25, 2020 Highest finishing Washington resident in the Open Section seeded into the 2021 Washington State Championship $12,000 Guaranteed Prize Fund! Hyatt Regency Bellevue 900 Bellevue Way NE Entry fees listed as: Postmarked Bellevue, WA 98004-4206, Phone (425) 698-4250 By April 19/ By May 13 / At site Online Registration at www.nwchess.com/onlineregistration Open EF $150 / $175 / $185 Pay by credit/debit or PayPal. Reserve (U1800) EF $135 / $160 / $170 Booster (U1400) EF $120 / $145 / $155 Format: A six-round Swiss system tournament in three sections, as shown at left. Medal Only EF (Juniors under age 21 & Rating: US Chess rated. Open Section also FIDE rated (except G/60 games which Seniors age 50+) EF $ 80 / $105 / $115 are US Chess dual rated only). US Chess May 2020 rating supplement will be used Play-up Fee: $40 if U1800 playing in Open to determine section eligibility. Higher of US Chess or foreign ratings used at TD Section discretion. Higher of US Chess or FIDE rating used for pairings and prizes in Open Section. Foreign ratings used for players with no US Chess rating. Unrated players Open Reserve Booster may only win top four prizes in the Open Section or unrated prizes in Booster 1st $1,200 $ 900 $ 600 Section. Medal Only players are ineligible to win any cash prizes. 2nd $ 900 $ 700 $ 500 3rd $ 700 $ 550 $ 400 Registration: Saturday 9:00-10:00 AM for 3-day schedule. Sunday 8:00-8:30 AM 4th $ 500 $ 400 $ 300 for 2-day schedule.
    [Show full text]
  • Kasparov's Nightmare!! Bobby Fischer Challenges IBM to Simul IBM
    California Chess Journal Volume 20, Number 2 April 1st 2004 $4.50 Kasparov’s Nightmare!! Bobby Fischer Challenges IBM to Simul IBM Scrambles to Build 25 Deep Blues! Past Vs Future Special Issue • Young Fischer Fires Up S.F. • Fischer commentates 4 Boyscouts • Building your “Super Computer” • Building Fischer’s Dream House • Raise $500 playing chess! • Fischer Articles Galore! California Chess Journal Table of Con tents 2004 Cal Chess Scholastic Championships The annual scholastic tourney finishes in Santa Clara.......................................................3 FISCHER AND THE DEEP BLUE Editor: Eric Hicks Contributors: Daren Dillinger A miracle has happened in the Phillipines!......................................................................4 FM Eric Schiller IM John Donaldson Why Every Chess Player Needs a Computer Photographers: Richard Shorman Some titles speak for themselves......................................................................................5 Historical Consul: Kerry Lawless Founding Editor: Hans Poschmann Building Your Chess Dream Machine Some helpful hints when shopping for a silicon chess opponent........................................6 CalChess Board Young Fischer in San Francisco 1957 A complet accounting of an untold story that happened here in the bay area...................12 President: Elizabeth Shaughnessy Vice-President: Josh Bowman 1957 Fischer Game Spotlight Treasurer: Richard Peterson One game from the tournament commentated move by move.........................................16 Members at
    [Show full text]
  • Extended Null-Move Reductions
    Extended Null-Move Reductions Omid David-Tabibi1 and Nathan S. Netanyahu1,2 1 Department of Computer Science, Bar-Ilan University, Ramat-Gan 52900, Israel [email protected], [email protected] 2 Center for Automation Research, University of Maryland, College Park, MD 20742, USA [email protected] Abstract. In this paper we review the conventional versions of null- move pruning, and present our enhancements which allow for a deeper search with greater accuracy. While the conventional versions of null- move pruning use reduction values of R ≤ 3, we use an aggressive re- duction value of R = 4 within a verified adaptive configuration which maximizes the benefit from the more aggressive pruning, while limiting its tactical liabilities. Our experimental results using our grandmaster- level chess program, Falcon, show that our null-move reductions (NMR) outperform the conventional methods, with the tactical benefits of the deeper search dominating the deficiencies. Moreover, unlike standard null-move pruning, which fails badly in zugzwang positions, NMR is impervious to zugzwangs. Finally, the implementation of NMR in any program already using null-move pruning requires a modification of only a few lines of code. 1 Introduction Chess programs trying to search the same way humans think by generating “plausible” moves dominated until the mid-1970s. By using extensive chess knowledge at each node, these programs selected a few moves which they consid- ered plausible, and thus pruned large parts of the search tree. However, plausible- move generating programs had serious tactical shortcomings, and as soon as brute-force search programs such as Tech [17] and Chess 4.x [29] managed to reach depths of 5 plies and more, plausible-move generating programs fre- quently lost to brute-force searchers due to their tactical weaknesses.
    [Show full text]
  • PUBLIC SUBMISSION Status: Pending Post Tracking No
    As of: January 02, 2020 Received: December 20, 2019 PUBLIC SUBMISSION Status: Pending_Post Tracking No. 1k3-9dz4-mt2u Comments Due: January 10, 2020 Submission Type: Web Docket: PTO-C-2019-0038 Request for Comments on Intellectual Property Protection for Artificial Intelligence Innovation Comment On: PTO-C-2019-0038-0002 Intellectual Property Protection for Artificial Intelligence Innovation Document: PTO-C-2019-0038-DRAFT-0009 Comment on FR Doc # 2019-26104 Submitter Information Name: Yale Robinson Address: 505 Pleasant Street Apartment 103 Malden, MA, 02148 Email: [email protected] General Comment In the attached PDF document, I describe the history of chess puzzle composition with a focus on three intellectual property issues that determine whether a chess composition is considered eligible for publication in a magazine or tournament award: (1) having one unique solution; (2) not being anticipated, and (3) not being submitted simultaneously for two different publications. The process of composing a chess endgame study using computer analysis tools, including endgame tablebases, is cited as an example of the partnership between an AI device and a human creator. I conclude with a suggestion to distinguish creative value from financial profit in evaluating IP issues in AI inventions, based on the fact that most chess puzzle composers follow IP conventions despite lacking any expectation of financial profit. Attachments Letter to USPTO on AI and Chess Puzzle Composition 35 - Robinson second submission - PTO-C-2019-0038-DRAFT-0009.html[3/11/2020 9:29:01 PM] December 20, 2019 From: Yale Yechiel N. Robinson, Esq. 505 Pleasant Street #103 Malden, MA 02148 Email: [email protected] To: Andrei Iancu Director of the U.S.
    [Show full text]
  • Computer Chess Methods
    COMPUTER CHESS METHODS T.A. Marsland Computing Science Department, University of Alberta, EDMONTON, Canada T6G 2H1 ABSTRACT Article prepared for the ENCYCLOPEDIA OF ARTIFICIAL INTELLIGENCE, S. Shapiro (editor), D. Eckroth (Managing Editor) to be published by John Wiley, 1987. Final draft; DO NOT REPRODUCE OR CIRCULATE. This copy is for review only. Please do not cite or copy. Acknowledgements Don Beal of London, Jaap van den Herik of Amsterdam and Hermann Kaindl of Vienna provided helpful responses to my request for de®nitions of technical terms. They and Peter Frey of Evanston also read and offered constructive criticism of the ®rst draft, thus helping improve the basic organization of the work. In addition, my many friends and colleagues, too numerous to mention individually, offered perceptive observations. To all these people, and to Ken Thompson for typesetting the chess diagrams, I offer my sincere thanks. The experimental work to support results in this article was possible through Canadian Natural Sciences and Engineering Research Council Grant A7902. December 15, 1990 COMPUTER CHESS METHODS T.A. Marsland Computing Science Department, University of Alberta, EDMONTON, Canada T6G 2H1 1. HISTORICAL PERSPECTIVE Of the early chess-playing machines the best known was exhibited by Baron von Kempelen of Vienna in 1769. Like its relations it was a conjurer's box and a grand hoax [1, 2]. In contrast, about 1890 a Spanish engineer, Torres y Quevedo, designed a true mechanical player for king-and-rook against king endgames. A later version of that machine was displayed at the Paris Exhibition of 1914 and now resides in a museum at Madrid's Polytechnic University [2].
    [Show full text]