DOCSLIB.ORG

Deep Thought Wins Fredkin Intermediate Prize Hans Berliner

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Deep Thought Wins Fredkin Intermediate Prize Hans Berliner AI Magazine Volume 10 Number 2 (1989) (© AAAI) CHESS REPORT Deep Thought Wins Fredkin Intermediate Prize Hans Berliner ince May 1988, Deep Thought almost all potential contenders. The S (DT), the creation of a team of two first place finishers drew with students at Carnegie Mellon Universi- each other. Hitech led the field at the ty, has been attracting a lot of notice. halfway point but lost to DT in round In the Fredkin Masters Open, May 3 and threw away a winning position 28–30, DT tied for second in a field of against Fidelity in round four (because over 20 masters and ahead of three of a programming bug). The level of other computers, including Hitech play in this tournament was by far the and Chiptest (the winner of the 1987 best ever in a computer event, and the North American Computer Champi- winners clearly deserved their top onships). In August at the U.S. Open, places. DT scored 8.5, 3.5 to tie for eigh- Ten days later, DT achieved the teenth place with Arnold Denker greatest computer success to date. It among others. Its performance was tied for first with GM Tony Miles in marred by hardware and software the prestigious Software Toolworks bugs. However, DT astounded every- Open in Los Angeles with a score of one by beating International Master 6.5, 1.5. Several GMs played in this (IM) Igor Ivanov, the perennial winner tournament, including former World of the U.S. Grand Prix circuit prize, Champion Mikhail Tal of the USSR. who is generally regarded to be as In the tournament, DT became the strong as the average Grandmaster first computer to beat a GM in a regu- (GM). lar tournament game when it beat In the American Open tournament GM Bent Larsen, a former world title in Los Angeles in October, DT scored contender when Bobby Fischer was a modest 4.5, 1.5. However, three competing. It lost many times to U.S. weeks later at the U.S. Class Champi- Champion GM Walter Browne and onships in New Jersey, DT had an drew with IM McCambridge. DT impressive 5, 1, beating two IMs achieved a 6.5, 1.5 score against a (Bonin and Zlotnikov). Thus, it field with an average rating of 2492, a became the first program to beat more truly incredible performance. This than one IM. In the Hall of Fame tour- result moved DT’s U.S. Chess Federa- nament in Canton, Ohio, in early tion (USCF) rating up to 2551, among November, DT won its first major the top 30 players in the United tournament, scoring 4.5, 0.5. During States. the tournament, it beat another IM After this event, DT qualified for (Blocker) and drew with co-winner IM the $10,000 Fredkin Intermediate Igor Ivanov, who was looking for Prize as the first computer to achieve revenge after what happened at the a USCF performance rating of 2500 U.S Open but was fortunate to escape over a set of 25 contiguous games in with a draw. human tournaments. The prize was A week later, in the strongest field awarded in January 1989 and was ever assembled for a computer chess shared equally among students Feng- event, DT tied for first with a special- Hsiung Hsu (head of the team and ly souped-up version of the top-of-the- designer of the hardware), Thomas line Fidelity Mach-III machine. The Anantharaman, Mike Browne, and winning score was 3.5, 0.5. This field Andreas Nowatzyk and Research 0738-4602/89/$3.50 © 1989 AAAI. also comprised Hitech, Cray Blitz, and Associate Murray Campbell, a former SUMMER 1989 00 student who is employed on the that operates within the framework of long as 30 ply are returned, and this Hitech project. DT’s record against the brute-force full-width alpha-beta kind of calculation can tax the ability GMs is now 1, 2 and against IMs 5, 2. search. This algorithm, called singular of the world’s best human players. DT These results mark its performance as extensions, makes it possible at mini- has announced a mate in 19 moves at least a strong IM. mal cost to detect that one move of a (37 ply) in an actual game, and DT is a dual-processor chess sibling set is clearly better than any Chiptest and Hitech have also per- machine in which 450,000 positions other alternative (Anantharaman, T., formed similarly, although somewhat per second can be done by each pro- Campbell, M., and Hsu, F. 1988. Sin- less deep. cessor and 700,000 per second by the gular Extensions: Adding Selectivity For those interested in more detail two working together. These figures to Brute Force Searching. Paper pre- on current computer chess activity, I make it the fastest chess machine sented at the 1988 AAAI Spring Sym- suggest joining the International ever, about five times faster than posium on Computer Game Playing, Computer Chess Association, which Hitech. DT’s predecessor, Chiptest, 22–24 March 1988, Stanford, Califor- produces a quarterly journal that cov- used only one of the move generator nia). Such moves play a powerful role ers these events in detail. Subscrip- chips in DT but was good enough to in determining forcing and forced tions (US $25/year) can be sent to win the 1987 North American Com- lines of play. Therefore, the algorithm Jonathan Schaeffer, Department of puter Championships with a perfect does not count such singular moves as Computing Science, University of score in a field that included Cray a ply toward the prespecified depth, as Alberta, Edmonton, Alberta, Canada Blitz, Belle, Lachex, and Phoenix. is normally done. The result is that on T6G 2H1. One reason (and we consider it the the average, an N ply search pene- major reason) for the recent excep- trates along the principal variation to Hans Berliner is a principal research scien- tional computer performances is the a depth of 1.5N and reaches a depth of tist in the Department of Computer Sci- discovery, by several members of the 3N about once in a game. This result ence, Carnegie Mellon University, Pitts- DT team, of a new search algorithm means that at times, variations as burgh, PA 15213. 00 AI MAGAZINE.
Load more

Recommended publications
  • Staysafe Welcome “I Wish It Need Not Have Happened in My Time,” Said Frodo
    KESPIRIT #StaySafe Welcome “I wish it need not have happened in my time,” said Frodo. Thank “So do I,” said Gandalf, “and so do all who live to see such times. But that is not for you to them to decide. All we have to decide is what to do with the time that is given us.” The Fellowship of the Ring, JRR Tolkien You can always trust an Old Edwardian to find the right words. everyone On Friday 20 March 2020, we held our last day in school for the remainder of the academic year. Here, just as everywhere, there was who is trepidation for the weeks ahead. Pupils and teachers went home laden with bags. No one knew how long we would be away from our desks, or what we would experience in the meantime. No one could predict how events would unfold, as we began what may be the Contents hardest days many of us will see in our lifetimes. PPE and medical supplies 4 But this was not the resounding tone of the day. Though there were keeping many things beyond our control, no one here on campus stood to dwell on the uncertainties. A can-do attitude swelled immediately. Science and academia 9 The leaving Sixth Form hurriedly completed all of their rites of passage before the doors closed. Staff launched an ‘online common Working on the frontline 13 room’ and created a rota for volunteering to look after those pupils who were to remain in school. People left the grounds offering their Responding to the pandemic 20 us support to one another, particularly those more adept with IT.
    [Show full text]
  • 2009 U.S. Tournament.Our.Beginnings
    Chess Club and Scholastic Center of Saint Louis Presents the 2009 U.S. Championship Saint Louis, Missouri May 7-17, 2009 History of U.S. Championship “pride and soul of chess,” Paul It has also been a truly national Morphy, was only the fourth true championship. For many years No series of tournaments or chess tournament ever held in the the title tournament was identi- matches enjoys the same rich, world. fied with New York. But it has turbulent history as that of the also been held in towns as small United States Chess Championship. In its first century and a half plus, as South Fallsburg, New York, It is in many ways unique – and, up the United States Championship Mentor, Ohio, and Greenville, to recently, unappreciated. has provided all kinds of entertain- Pennsylvania. ment. It has introduced new In Europe and elsewhere, the idea heroes exactly one hundred years Fans have witnessed of choosing a national champion apart in Paul Morphy (1857) and championship play in Boston, and came slowly. The first Russian Bobby Fischer (1957) and honored Las Vegas, Baltimore and Los championship tournament, for remarkable veterans such as Angeles, Lexington, Kentucky, example, was held in 1889. The Sammy Reshevsky in his late 60s. and El Paso, Texas. The title has Germans did not get around to There have been stunning upsets been decided in sites as varied naming a champion until 1879. (Arnold Denker in 1944 and John as the Sazerac Coffee House in The first official Hungarian champi- Grefe in 1973) and marvelous 1845 to the Cincinnati Literary onship occurred in 1906, and the achievements (Fischer’s winning Club, the Automobile Club of first Dutch, three years later.
    [Show full text]
  • From Los Angeles to Reykjavik
    FROM LOS ANGELES CHAPTER 5: TO REYKJAVIK 1963 – 68 In July 1963 Fridrik Ólafsson seized a against Reshevsky in round 10 Fridrik ticipation in a top tournament abroad, Fridrik spent most of the nice opportunity to take part in the admits that he “played some excellent which occured January 1969 in the “First Piatigorsky Cup” tournament in games in this tournament”. Dutch village Wijk aan Zee. five years from 1963 to Los Angeles, a world class event and 1968 in his home town the strongest one in the United States For his 1976 book Fridrik picked only Meanwhile from 1964 the new bian- Reykjavik, with law studies since New York 1927. The new World this one game from the Los Angeles nual Reykjavik chess international gave Champion Tigran Petrosian was a main tournament. We add a few more from valuable playing practice to both their and his family as the main attraction, and all the other seven this special event. For his birthday own chess hero and to the second best priorities. In 1964 his grandmasters had also participated at greetings to Fridrik in “Skák” 2005 Jan home players, plus provided contin- countrymen fortunately the Candidates tournament level. They Timman showed the game against Pal ued attention to chess when Fridrik Benkö from round 6. We will also have Ólafsson competed on home ground started the new biannual gathered in the exclusive Ambassador Hotel in Los Angeles for a complete a look at some critical games which against some famous foreign players. international tournament double round event of 14 rounds.
    [Show full text]
  • Mind-Bending Analysis and Instructive Comment from a Man Who Has Participated in World Chess at the Very Highest Levels
    Mind-bending analysis and instructive comment from a man who has participated in world chess at the very highest levels World championship candidate and three-times British Champion Jon Speelman annotates the best of his games. He is renowned as a great fighter and analyst, and a highly original player. This book provides entertainment and instruction in abundance. Games and stories from his: • World Championship campaigns • Chess Olympiads • Toi>level grandmaster tournaments, including the World Cup Jon Speelman is one of only two British players this century to gain a place in the world's top five. He has reached the sem>finals of the world championship and is one of the stars of the English national team, which has won the silver medals three times in the chess Olympiads. Jon Speelman's Best Games Jon Speelman B. T. Batsford Ltd, London First published 1997 © Jon Speelman 1997 ISBN 0 7134 6477 I British Library Cataloguing-in-Publication Data. Contents A catalogue record for this book is available from the British Library. All rights reserved. No part of this book may be reproduced, by any means, without prior permission of the publisher. Introduction 5 Typeset and edited by First Rank Publishing, Brighton and printed in Great Britain by Redwood Books, Trowbridge, Wilts Part I Growing up as a Chess player for the publishers, B. T. Batsford Ltd, Juvenilia 7 583 Fulham Road, I JS-J.Fletcher, British U-14 Ch., Rhyl1969 9 London SW6 5BY 2 JS-E.Warren, Thames Valley Open 1970 11 3 A.Miles-JS, Islington Open 1970 14 4 JS-Hanau, Nice 1971
    [Show full text]
  • Grand Prix Proves to Be Right Formula
    7.Ng1–f3 0–0 22... e7-e6 A better idea was 7...Bc8-g4, 23.Qg6-h7+ Kg8-f7 CHESS getting rid of the light-squared 24.f5xe6+ Bc8xe6 July 5th 2008 bishop which is hard to find 25.Rh3-h6 Qc7-e5 a good post for. Another 26.Qh7-g6+ Kf7-g8 Michael interesting option was 7...c5-c4, 27.Rf1xf6 Qe5-d4+ trying to create counterplay. 28.Rf6-f2 Adams Even with what feels like 8.0–0 b7-b6 an overwhelming position, Black doesn't sense any danger it is important to maintain and makes some quiet moves, concentration. The rook retreat but he should have paid more forced resignation but the attention to White’s plans. blunder 28.Kg1–h1 Qd4xf6 Grand Prix As we shall see he can quickly 29.Qg6xf6 Rd8-f8 would lead develop a strong initiative on to a roughly level position. the kingside. proves to be 1–0 9.Qd1–e1 Bc8-g4 right formula The worst possible moment The 2nd edition of Secrets of for this move as the knight is Spectacular Chess by Jonathan no longer pinned. 9...Nf6-d7 Levitt and David Friedgood Gawain Jones is the latest in was preferable although, after (Everyman, £14.99) is a slightly a long line of English players 10.f4-f5 there is trouble ahead expanded version of the 1999 who have specialised in for the Black monarch. original, in which they analysed meeting the Sicilian in an the beauty in chess. off-beat manner. He has 10.Nf3-e5 Qd8-c7 The book is especially shared his expertise in his 11.Qe1–h4 Bg4-e6 interesting to players with little first book, Starting Out: 12.Ne5-f3 h7-h6 experience of studies who will Sicilian Grand Prix Attack 12...Be6-c8 13.f4-f5 is no discover many paradoxical (Everyman, £14.99).
    [Show full text]
  • Catur Komputer Dari Wikipedia Bahasa Indonesia, Ensiklopedia Bebas
    Deep Blue Dari Wikipedia bahasa Indonesia, ensiklopedia bebas Belum Diperiksa Deep Blue Deep Blue adalah sebuah komputer catur buatan IBM. Deep Blue adalah komputer pertama yang memenangkan sebuah permainan catur melawan seorang juara dunia (Garry Kasparov) dalam waktu standar sebuah turnamen catur. Kemenangan pertamanya (dalam pertandingan atau babak pertama) terjadi pada 10 Februari 1996, dan merupakan permainan yang sangat terkenal. Namun Kasparov kemudian memenangkan 3 pertandingan lainnya dan memperoleh hasil remis pada 2 pertandingan selanjutnya, sehingga mengalahkan Deep Blue dengan hasil 4-2. Deep Blue lalu diupgrade lagi secara besar-besaran dan kembali bertanding melawan Kasparov pada Mei 1997. Dalam pertandingan enam babak tersebut Deep Blue menang dengan hasil 3,5- 2,5. Babak terakhirnya berakhir pada 11 Mei. Deep Blue menjadi komputer pertama yang mengalahkan juara dunia bertahan. Komputer ini saat ini sudah "dipensiunkan" dan dipajang di Museum Nasional Sejarah Amerika (National Museum of American History),Amerika Serikat. http://id.wikipedia.org/wiki/Deep_Blue Catur komputer Dari Wikipedia bahasa Indonesia, ensiklopedia bebas Komputer catur dengan layar LCD pada 1990-an Catur komputer adalah arsitektur komputer yang memuat perangkat keras dan perangkat lunak komputer yang mampu bermain caturtanpa kendali manusia. Catur komputer berfungsi sebagai alat hiburan sendiri (yang membolehkan pemain latihan atau hiburan jika lawan manusia tidak ada), sebagai alat bantu kepada analisis catur, untuk pertandingan catur komputer dan penelitian untuk kognisi manusia. Kategori Deep Blue (chess computer) From Wikipedia, the free encyclopedia Deep Blue Deep Blue was a chess-playing computer developed by IBM. On May 11, 1997, the machine, with human intervention between games, won the second six-game match against world champion Garry Kasparov, two to one, with three draws.[1] Kasparov accused IBM of cheating and demanded a rematch.
    [Show full text]
  • May 2020 E S
    $3.95 orthwes N t C h May 2020 e s s Northwest Chess On the front cover: May 2020, Volume 74-05 Issue 868 Photo credit: Philip Peterson. ISSN Publication 0146-6941 Published monthly by the Northwest Chess Board. POSTMASTER: Send address changes to the Office of Record: Northwest Chess c/o Orlov Chess Academy 4174 148th Ave NE, On the back cover: Building I, Suite M, Redmond, WA 98052-5164. Paul Morphy grave. New Orleans, Louisiana. Photo credit: Philip Peterson. Periodicals Postage Paid at Seattle, WA USPS periodicals postage permit number (0422-390) NWC Staff Chesstoons: Editor: Jeffrey Roland, Chess cartoons drawn by local artist Brian Berger, [email protected] of West Linn, Oregon. Games Editor: Ralph Dubisch, [email protected] Publisher: Duane Polich, Submissions [email protected] Business Manager: Eric Holcomb, Submissions of games (PGN format is preferable for games), [email protected] stories, photos, art, and other original chess-related content are encouraged! Multiple submissions are acceptable; please indicate if material is non-exclusive. All submissions are subject Board Representatives to editing or revision. Send via U.S. Mail to: Chouchanik Airapetian, Eric Holcomb, Jeffrey Roland, NWC Editor Alex Machin, Duane Polich, Ralph Dubisch, 1514 S. Longmont Ave. Jeffrey Roland, Josh Sinanan. Boise, Idaho 83706-3732 or via e-mail to: Entire contents ©2020 by Northwest Chess. All rights reserved. [email protected] Published opinions are those of the contributors and do not necessarily reflect the views of the editor or the Northwest Chess Board. Northwest Chess is the official publication of the chess Northwest Chess Knights governing bodies of the states of Washington and Idaho.
    [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]
  • Multilinear Algebra and Chess Endgames
    Games of No Chance MSRI Publications Volume 29, 1996 Multilinear Algebra and Chess Endgames LEWIS STILLER Abstract. This article has three chief aims: (1) To show the wide utility of multilinear algebraic formalism for high-performance computing. (2) To describe an application of this formalism in the analysis of chess endgames, and results obtained thereby that would have been impossible to compute using earlier techniques, including a win requiring a record 243 moves. (3) To contribute to the study of the history of chess endgames, by focusing on the work of Friedrich Amelung (in particular his apparently lost analysis of certain six-piece endgames) and that of Theodor Molien, one of the founders of modern group representation theory and the first person to have systematically numerically analyzed a pawnless endgame. 1. Introduction Parallel and vector architectures can achieve high peak bandwidth, but it can be difficult for the programmer to design algorithms that exploit this bandwidth efficiently. Application performance can depend heavily on unique architecture features that complicate the design of portable code [Szymanski et al. 1994; Stone 1993]. The work reported here is part of a project to explore the extent to which the techniques of multilinear algebra can be used to simplify the design of high- performance parallel and vector algorithms [Johnson et al. 1991]. The approach is this: Define a set of fixed, structured matrices that encode architectural primitives • of the machine, in the sense that left-multiplication of a vector by this matrix is efficient on the target architecture. Formulate the application problem as a matrix multiplication.
    [Show full text]
  • Solingen (Unregular)
    Solingen (unregular) International tournaments 1968 (100th anniversary tournament of the Solingen Chess Club) Lengyel clear first, ahead of 2. Parma, 3.-7. Pachman, Szabo, Damjanovic, Janosevic (16 players, including O’Kelly, Donner, Medina, Tatai, Lehmann, and Wade who wrote a tournament book; IM Gerusel shared 8th place). This was maybe Levente Lengyel’s (GM in 1964) finest tournament win, he also won at Rome 1964 (joint with Lehmann), Bari 1972 outright, and Reggio Emilia 1972/73 (joint with Popov and Torre). MATHIAS GERUSEL (born Feb-05-1938) Germany Mathias Gerusel is a (West) German IM who finished second to William James Lombardy at the World Junior Championship (1967). He went on to study mathematics. His best tournament results have been 3rd at Büsum 1969 after Bent Larsen and Lev Polugaevsky, and 5th= at Solingen 1974. 1974 Polugaevsky, Kavalek, ahead of 3.-4. Spassky, Kurajica, (15 players, Pachman boycotted), IM Gerusel shared 5th place together with Szabo, Liberzon, and Westerinen, above 9. Uhlmann; including also Heinz Lehmann, and Hajo Hecht) ttp://www.teleschach.de/historie/solingen1974.htm (Standings) http://www.zeit.de/1974/30/der-ausdruck-des-bedauerns (Boycott of Pachman) 1986 (international club championship) Hübner clear first, ahead of 2./3. IM Ralf Lau, Short (Lau beat Short in their direct game) 4. Kavalek, 5.-6 Spassky, IM Lucas Brunner, 7.-8. Sunye-Neto, Westerinen (12 players, among them German IM Capelan who played already in 1968 and in 1974). Note: Brunner vs. Schneider (https://www.365chess.com/game.php?gid=2169447) has a wrong score, Brunner won Ralf Lau achieved his third an final GM norm to become a grandmaster.
    [Show full text]
  • Oral History of Hans Berliner
    Oral History of Hans Berliner Interviewed by: Gardner Hendrie Recorded: March 7, 2005 Riviera Beach, Florida Total Running Time: 2:33:00 CHM Reference number: X3131.2005 © 2005 Computer History Museum CHM Ref: X3131.2005 © 2005 Computer History Museum Page 1 of 65 Q: Who has graciously agreed to do an oral history for the Computer History Museum. Thank you very much, Hans. Hans Berliner: Oh, you’re most welcome. Q: O.k. I think where I’d like to start is maybe a little further back than you might expect. I’d like to know if you could share with us a little bit about your family background. The environment that you grew up in. Your mother and father, what they did. Your brothers and sisters. Hans Berliner: O.k. Q: Where you were born. That sort of thing. Hans Berliner: O.k. I was born in Berlin in 1929, and we immigrated to the United States, very fortunately, in 1937, to Washington, D.C. As far as the family goes, my great uncle, who was my grandfather’s brother, was involved in telephone work at the turn of the previous century. And he actually owned the patent on the carbon receiver for the telephone. And they started a telephone company in Hanover, Germany, based upon his telephone experience. And he, later on, when Edison had patented the cylinder for recording, he’d had enough experience with sound recording that he said, “that’s pretty stupid”. And he decided to do the recording on a disc, and he successfully defended his patent in the Supreme Court, and so the patent on the phono disc belongs to Emile Berliner, who was my grand uncle.
    [Show full text]
  • YEARBOOK the Information in This Yearbook Is Substantially Correct and Current As of December 31, 2020
    OUR HERITAGE 2020 US CHESS YEARBOOK The information in this yearbook is substantially correct and current as of December 31, 2020. For further information check the US Chess website www.uschess.org. To notify US Chess of corrections or updates, please e-mail [email protected]. U.S. CHAMPIONS 2002 Larry Christiansen • 2003 Alexander Shabalov • 2005 Hakaru WESTERN OPEN BECAME THE U.S. OPEN Nakamura • 2006 Alexander Onischuk • 2007 Alexander Shabalov • 1845-57 Charles Stanley • 1857-71 Paul Morphy • 1871-90 George H. 1939 Reuben Fine • 1940 Reuben Fine • 1941 Reuben Fine • 1942 2008 Yury Shulman • 2009 Hikaru Nakamura • 2010 Gata Kamsky • Mackenzie • 1890-91 Jackson Showalter • 1891-94 Samuel Lipchutz • Herman Steiner, Dan Yanofsky • 1943 I.A. Horowitz • 1944 Samuel 2011 Gata Kamsky • 2012 Hikaru Nakamura • 2013 Gata Kamsky • 2014 1894 Jackson Showalter • 1894-95 Albert Hodges • 1895-97 Jackson Reshevsky • 1945 Anthony Santasiere • 1946 Herman Steiner • 1947 Gata Kamsky • 2015 Hikaru Nakamura • 2016 Fabiano Caruana • 2017 Showalter • 1897-06 Harry Nelson Pillsbury • 1906-09 Jackson Isaac Kashdan • 1948 Weaver W. Adams • 1949 Albert Sandrin Jr. • 1950 Wesley So • 2018 Samuel Shankland • 2019 Hikaru Nakamura Showalter • 1909-36 Frank J. Marshall • 1936 Samuel Reshevsky • Arthur Bisguier • 1951 Larry Evans • 1952 Larry Evans • 1953 Donald 1938 Samuel Reshevsky • 1940 Samuel Reshevsky • 1942 Samuel 2020 Wesley So Byrne • 1954 Larry Evans, Arturo Pomar • 1955 Nicolas Rossolimo • Reshevsky • 1944 Arnold Denker • 1946 Samuel Reshevsky • 1948 ONLINE: COVID-19 • OCTOBER 2020 1956 Arthur Bisguier, James Sherwin • 1957 • Robert Fischer, Arthur Herman Steiner • 1951 Larry Evans • 1952 Larry Evans • 1954 Arthur Bisguier • 1958 E.
    [Show full text]