DOCSLIB.ORG

Beyond the 3000 Elo Barrier a Glance Behind the Scenes of the Rybka Chess Engine by HARALD FIETZ

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read 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. df/). However, chess computer experts thirteen years. Now, I am working full- My partner Convekta Ltd. handles the now regard the results of other time on Rybka in Budapest, Hungary.” business and marketing and develops test teams as more reliable (e.g. He came over to Europe mainly in order graphic user interfaces on which Rybka http://www.husvankempen.de/nunn/ or to pursue his chess career after he was runs. Jeroen Noomen from the http://www.computerchess.org.uk/ccrl/ fascinated by the royal game Netherlands writes the Rybka opening 4040/). Depending on hardware, Rybka comparatively late: “Chess was quite book – this is an extremely competitive surpasses every other program by 60 big in my family, mainly thanks to my sub-discipline of computer chess which rating points at least, and is the first grandfather on my father’s side, who has quite an impact on engine results. engine which has established itself was a very enthusiastic chess player in My wife Iweta uses Rybka constantly beyond the 3000 Elo rating barrier. the Czech city of Tabor. I started to play and gives me feedback which I use to Among top players, Rybka is tournaments quite casually at first, improve the engine. The Polish GM increasingly regarded as an added value when I was about 20, and then went Michal Krasenkov is a member of our to the engines they traditionally use; through a big chess phase in the period team in the freestyle events. Christoph Alexander Morozevich even gave 1997 through 2003 or so. Now I am an and Felix Kling from Germany have Rybka the highest score in his voting international master.” Like most other developed the Rybka web site for the Chess Oscar 2005 and put ‘chess travellers’ he chose Budapest as (www.rybkachess.com). In addition, forward allegations that the ‘Topalov a hot-spot for ambitious chess players. there are dozens of other testers and test team’ might have used this tool for However, this also turned out to be the groups around the world who give me cheating activities. place to find his private future: “Around useful ideas and test results, and who Therefore, it is high time to get first- 5 years ago I met Iweta Radziewicz at a create the objective test environments hand information from the man behind tournament in Budapest, and we got for chess engines, without which the machine. The place to meet Rajlich married on August 19, 2006 in computer chess itself would not exist. was the Hungarian capital of Budapest, Piaseczno near Warsaw.” The Rybka project would hardly and the visit also offered a unique The now 26 year old Polish be possible, at least in its current opportunity to peek over the shoulder of international used her years of study to form, without all of this help.” The his team in order to watch the man- continue her junior achievements at the fundaments can be traced back to his machine interaction during a freestyle top of the world ranking. Besides teenage years: “I’ve been programming qualification tournament. finishing her diploma in psychology in my whole life, I wrote hundreds of 2005 (with a thesis on “Risk perception programs before I even got to college. From computer freak and assessment among chess players”) These programs included a Connect-4 to chess couple she got the male IM title and one GM program (a two-player board game in norm so far. Now the five times Polish which players take turns dropping discs In a few years time Rajlich’s career women champion, who won her latest into a vertical grid, with the objective of might be described as a typical title in March 2007 in Barlinek getting four of one’s own discs in a American rise from rags to riches. (Emanuel Lasker’s place of birth), is line), this was my first experience with However, this time the American has ‘the main tester’ of the Rybka program game-playing algorithms.” The idea left the States to try his luck in ‘old’ and assesses its values from the of creating a chess program for Europe. He describes his life-long tournament player’s point of view: professionals combined Rajlich’s hobby shuttle across the Atlantic: “I was born “Rybka is quite an objective analysis and skills he learnt at university. in Cleveland in 1971 where my Czech tool and tends to defend very well, so Nevertheless, it is not easy for him to parents were studying at the time. My perhaps I learnt to sacrifice more define a chess programmer’s profile: father is a mathematician and later correctly. Many times my sacrifices “The main qualification is kind of 18 CHESS May 2007 vague – it’s a sort of semi-mathematical you a model position in order to what he suggests. In the opening and thinking ability which is hard to pin demonstrate this function. early middle game as well as in the down exactly. Some people just have it, XIIIIIIIIY endgame we tend more to overrule the others haven’t. Of course, it also helps Rybka engine more often than in the to have software development skills and 9r+l+-trk+0 middle game. White’s moves g6! and chess skill. My main interest in 9zpp+-+qzp-0 h5 in the game Rajlich-Intragrand are computer science has always been 9-+p+p+-+0 human discoveries (included below as artificial intelligence, for instance, at 9+-+p+p+-0 part of the analysis of Rajlich- ERIM we developed algorithms to Kingscrusher). identify features on radar images, etc. It 9-+-zP-zP-+0 Furthermore, we are using Rybka to had always been in the back of my mind 9sN-+-zP-zP-0 go deeply into tactical lines. If the that some day I would write a chess 9PzPP+-+K+0 position is rather strategic (I mean with program. Finally, in January 2003, I got 9tR-+Q+-+R0 little tactics) we try to choose a plan. started, and immediately stopped doing For instance, in the game of Poweroff everything else.” xiiiiiiiiy with the white pieces against Rajlich in Now the daily life of this Washington The above position is meant to the final of the 3rd freestyle Redskins fan – and of the NFL in illustrate the idea that positional competition, we had a very difficult general – looks pretty much all the evaluations change as the search gets position, and in order to save the game same in their small two room-flat in the deeper. Rybka’s static evaluation has no Michal came up with a clever idea of centre of the Hungarian capital, some trouble understanding that the bishop exchanging knights for the cost of 200 meters away from the Danube and on c8 is a bad piece, so this bishop will another pawn. The game transposed the famous Liberty bridge: “It very be consistently reported as a bad piece, into opposite-colour bishop endgame much depends, but Rybka development regardless of how much searching is where Poweronoff (who played as an goes through cycles which are roughly done. This will be indicated to the user unattended Rybka) had two pawns as follows: 1) get a new idea; 2) refine via some sort of colour coding of the more. I don’t have to mention that the idea, maybe make some preliminary piece or the square it sits on. The knight sacrificing a pawn for an idea which experiments; 3) initial implementation on a3, on the other hand, is very appears in 20 moves later in a drawn of the idea and 4) testing.
Load more

Recommended publications
  • A New Look at the Tayler by David Kane
    A New Look at the Tayler by David kane I: Introduction The Tayler Variation (aka the Tayler Opening) is a line that has been unjustly neglected, in my view. The line is of surprisingly recent vintage though it is often confused with the Inverted Hungarian (or Inverted Hanham Defense), a line which shares the same opening moves: 1. e4 e5 2. Nf3 Nc6 3. Be2: The Inverted Hungarian is an old opening, dating back to the 1860ʼs, at least. Tartakower played it a few times in the 1920ʼs with mixed results, using the continuation, 3...Nf6 4. d3: a rather unenterprising setup for White. In 1981 British player, John Tayler (see biographical note), published an article in the British publication Chess (vol. 46) on a line he had developed stemming from the sharp 4. d4!?. This is a move which apparently no one had thought to play before, and one that transforms the sedate Inverted Hungarian into something else altogether. Technically, it is really the Tayler Variation to the Inverted Hungarian Defense rather than the Tayler Opening, though through usage, the terms are interchangeable for all practical purposes. As has been so often the case when it comes to unorthodox lines, I first heard of this opening via Mike Basman when he published a cassette on it back in the early 80ʼs (still available through audiochess.com). Tayler 2 The line stirred some interest at the time but gradually seems to have been forgotten. The final nail in the coffin was probably some light analysis published by Eric Schiller in Gambit Chess Openings (and elsewhere) where he dismisses the line primarily due to his loss in the game Schiller-Martinovsky, Chicago 1986.
    [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]
  • Python-Chess Release 1.0.0 Unknown
    python-chess Release 1.0.0 unknown Sep 24, 2020 CONTENTS 1 Introduction 3 2 Documentation 5 3 Features 7 4 Installing 11 5 Selected use cases 13 6 Acknowledgements 15 7 License 17 8 Contents 19 8.1 Core................................................... 19 8.2 PGN parsing and writing......................................... 35 8.3 Polyglot opening book reading...................................... 42 8.4 Gaviota endgame tablebase probing................................... 44 8.5 Syzygy endgame tablebase probing................................... 45 8.6 UCI/XBoard engine communication................................... 47 8.7 SVG rendering.............................................. 58 8.8 Variants.................................................. 59 8.9 Changelog for python-chess....................................... 61 9 Indices and tables 93 Index 95 i ii python-chess, Release 1.0.0 CONTENTS 1 python-chess, Release 1.0.0 2 CONTENTS CHAPTER ONE INTRODUCTION python-chess is a pure Python chess library with move generation, move validation and support for common formats. This is the Scholar’s mate in python-chess: >>> import chess >>> board= chess.Board() >>> board.legal_moves <LegalMoveGenerator at ... (Nh3, Nf3, Nc3, Na3, h3, g3, f3, e3, d3, c3, ...)> >>> chess.Move.from_uci("a8a1") in board.legal_moves False >>> board.push_san("e4") Move.from_uci('e2e4') >>> board.push_san("e5") Move.from_uci('e7e5') >>> board.push_san("Qh5") Move.from_uci('d1h5') >>> board.push_san("Nc6") Move.from_uci('b8c6') >>> board.push_san("Bc4") Move.from_uci('f1c4')
    [Show full text]
  • SHOWCASE BC 831 Funding Offers for BC Artists
    SHOWCASE BC 831 Funding Offers for BC Artists Funding offers were sent to the following artists on April 17 + April 21, 2020. Artists have until May 15, 2020, to accept the grant. A Million Dollars in Pennies ArkenFire Booty EP Abraham Arkora BOSLEN ACTORS Art d’Ecco Bratboy Adam Bailie Art Napoleon Bre McDaniel Adam Charles Wilson Asha Diaz Brent Joseph Adam Rosenthal Asheida Brevner Adam Winn Ashleigh Adele Ball Bridal Party Adera A-SLAM Bring The Noise Adewolf Astrocolor Britt A.M. Adrian Chalifour Autogramm Brooke Maxwell A-DUB AutoHeart Bruce Coughlan Aggression Aza Nabuko Buckman Coe Aidan Knight Babe Corner Bukola Balogan Air Stranger Balkan Shmalkan Bunnie Alex Cuba bbno$ Bushido World Music Alex Little and The Suspicious Beamer Wigley C.R. Avery Minds Bear Mountain Cabins In The Clouds Alex Maher Bedouin Soundclash Caitlin Goulet Alexander Boynton Jr. Ben Cottrill Cam Blake Alexandria Maillot Ben Dunnill Cam Penner Alien Boys Ben Klick Camaro 67 Alisa Balogh Ben Rogers Capri Everitt Alpas Collective Beth Marie Anderson Caracas the Band Alpha Yaya Diallo Betty and The Kid Cari Burdett Amber Mae Biawanna Carlos Joe Costa Andrea Superstein Big John Bates Noirchestra Carmanah Andrew Judah Big Little Lions Carsen Gray Andrew Phelan Black Mountain Whiskey Carson Hoy Angela Harris Rebellion Caryn Fader Angie Faith Black Wizard Cassandra Maze Anklegod Blackberry Wood Cassidy Waring Annette Ducharme Blessed Cayla Brooke Antoinette Blonde Diamond Chamelion Antonio Larosa Blue J Ché Aimee Dorval Anu Davaasuren Blue Moon Marquee Checkmate
    [Show full text]
  • March 2020 Uschess.Org the United States’ Largest Chess Specialty Retailer
    March 2020 USChess.org The United States’ Largest Chess Specialty Retailer 888.51.CHESS (512.4377) www.USCFSales.com ƩĂĐŬŝŶŐǁŝƚŚŐϮͲŐϰ The 100 Endgames You Must Know Workbook The Modern Way to Get the Upper Hand in Chess WƌĂĐƟĐĂůŶĚŐĂŵĞƐdžĞƌĐŝƐĞƐĨŽƌǀĞƌLJŚĞƐƐWůĂLJĞƌ Dmitry Kryavkin 288 pages - $24.95 Jesus de la Villa 288 pages - $24.95 dŚĞƉĂǁŶƚŚƌƵƐƚŐϮͲŐϰŝƐĂƉĞƌĨĞĐƚǁĂLJƚŽĐŽŶĨƵƐĞLJŽƵƌ ͞/ůŽǀĞƚŚŝƐŬ͊/ŶŽƌĚĞƌƚŽŵĂƐƚĞƌĞŶĚŐĂŵĞƉƌŝŶĐŝƉůĞƐLJŽƵ ŽƉƉŽŶĞŶƚƐĂŶĚĚŝƐƌƵƉƚƚŚĞŝƌƉŽƐŝƟŽŶ͘tŝƚŚůŽƚƐŽĨŝŶƐƚƌƵĐƟǀĞ ǁŝůůŶĞĞĚƚŽƉƌĂĐƟĐĞƚŚĞŵ͘͟ʹNM Han Schut, Chess.com ĞdžĂŵƉůĞƐ'D<ƌLJĂŬǀŝŶƐŚŽǁƐŚŽǁŝƚĐĂŶďĞƵƐĞĚƚŽĚĞĨĞĂƚ ͞dŚĞƉĞƌĨĞĐƚƐƵƉƉůĞŵĞŶƚƚŽĞůĂsŝůůĂ͛ƐŵĂŶƵĂů͘dŽŐĂŝŶ ůĂĐŬŝŶƚŚĞƵƚĐŚ͕ƚŚĞYƵĞĞŶ͛Ɛ'Ăŵďŝƚ͕ƚŚĞEŝŵnjŽͲ/ŶĚŝĂŶ͕ ƐƵĸĐŝĞŶƚŬŶŽǁůĞĚŐĞŽĨƚŚĞŽƌĞƟĐĂůĞŶĚŐĂŵĞƐLJŽƵƌĞĂůůLJŽŶůLJ ƚŚĞ<ŝŶŐ͛Ɛ/ŶĚŝĂŶ͕ƚŚĞ^ůĂǀĂŶĚƚŚĞŶŐůŝƐŚKƉĞŶŝŶŐ͘>ĞĂƌŶ ŶĞĞĚƚǁŽďŽŽŬƐ͘͟ʹIM Herman Grooten, Schaaksite NEW! ƚŚĞƚLJƉŝĐĂůǁĂLJƐƚŽŐĂŝŶƚĞŵƉŝ͕ŬĞĞƉƚŚĞŵŽŵĞŶƚƵŵĂŶĚ ŵĂdžŝŵŝnjĞLJŽƵƌŽƉƉŽŶĞŶƚ͛ƐƉƌŽďůĞŵƐ͘ Strategic Chess Exercises Keep It Simple 1.d4 Find the Right Way to Outplay Your Opponent ^ŽůŝĚĂŶĚ^ƚƌĂŝŐŚƞŽƌǁĂƌĚŚĞƐƐKƉĞŶŝŶŐZĞƉĞƌƚŽŝƌĞĨŽƌtŚŝƚĞ Emmanuel Bricard 224 pages - $24.95 Christof Sielecki 432 pages - $29.95 &ŝŶĂůůLJĂŶĞdžĞƌĐŝƐĞƐŬƚŚĂƚŝƐŶŽƚĂďŽƵƚƚĂĐƟĐƐ͊ ^ŝĞůĞĐŬŝ͛ƐƌĞƉĞƌƚŽŝƌĞǁŝƚŚϭ͘ĚϰŵĂLJďĞĞǀĞŶĞĂƐŝĞƌƚŽ ͞ƌŝĐĂƌĚŝƐĐůĞĂƌůLJĂǀĞƌLJŐŝŌĞĚƚƌĂŝŶĞƌ͘,ĞƐĞůĞĐƚĞĚĂƐƵƉĞƌď ŵĂƐƚĞƌƚŚĂŶŚŝƐϭ͘ĞϰƌĞĐŽŵŵĞŶĚĂƟŽŶƐ͕ďĞĐĂƵƐĞŝƚŝƐƐƵĐŚĂ ƌĂŶŐĞŽĨƉŽƐŝƟŽŶƐĂŶĚĞdžƉůĂŝŶƐƚŚĞƐŽůƵƟŽŶƐĞdžƚƌĞŵĞůLJ ĐŽŚĞƌĞŶƚƐLJƐƚĞŵ͗ƚŚĞŵĂŝŶĐŽŶĐĞƉƚŝƐĨŽƌtŚŝƚĞƚŽƉůĂLJϭ͘Ěϰ͕ ǁĞůů͘͟ʹGM Daniel King Ϯ͘EĨϯ͕ϯ͘Őϯ͕ϰ͘ŐϮ͕ϱ͘ϬͲϬĂŶĚŝŶŵŽƐƚĐĂƐĞƐϲ͘Đϰ͘ ͞&ŽƌĐŚĞƐƐĐŽĂĐŚĞƐƚŚŝƐŬŝƐŶŽƚŚŝŶŐƐŚŽƌƚŽĨƉŚĞŶŽŵĞŶĂů͘͟ ͞Ɛ/ƚŚŝŶŬƚŚĂƚ/ƐŚŽƵůĚŬĞĞƉŵLJĂĚǀŝĐĞ͚ƐŝŵƉůĞ͕͛/ǁŽƵůĚƐĂLJ
    [Show full text]
  • Distributional Differences Between Human and Computer Play at Chess
    Multidisciplinary Workshop on Advances in Preference Handling: Papers from the AAAI-14 Workshop Human and Computer Preferences at Chess Kenneth W. Regan Tamal Biswas Jason Zhou Department of CSE Department of CSE The Nichols School University at Buffalo University at Buffalo Buffalo, NY 14216 USA Amherst, NY 14260 USA Amherst, NY 14260 USA [email protected] [email protected] Abstract In our case the third parties are computer chess programs Distributional analysis of large data-sets of chess games analyzing the position and the played move, and the error played by humans and those played by computers shows the is the difference in analyzed value from its preferred move following differences in preferences and performance: when the two differ. We have run the computer analysis (1) The average error per move scales uniformly higher the to sufficient depth estimated to have strength at least equal more advantage is enjoyed by either side, with the effect to the top human players in our samples, depth significantly much sharper for humans than computers; greater than used in previous studies. We have replicated our (2) For almost any degree of advantage or disadvantage, a main human data set of 726,120 positions from tournaments human player has a significant 2–3% lower scoring expecta- played in 2010–2012 on each of four different programs: tion if it is his/her turn to move, than when the opponent is to Komodo 6, Stockfish DD (or 5), Houdini 4, and Rybka 3. move; the effect is nearly absent for computers. The first three finished 1-2-3 in the most recent Thoresen (3) Humans prefer to drive games into positions with fewer Chess Engine Competition, while Rybka 3 (to version 4.1) reasonable options and earlier resolutions, even when playing was the top program from 2008 to 2011.
    [Show full text]
  • A Survey of Monte Carlo Tree Search Methods
    IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES, VOL. 4, NO. 1, MARCH 2012 1 A Survey of Monte Carlo Tree Search Methods Cameron Browne, Member, IEEE, Edward Powley, Member, IEEE, Daniel Whitehouse, Member, IEEE, Simon Lucas, Senior Member, IEEE, Peter I. Cowling, Member, IEEE, Philipp Rohlfshagen, Stephen Tavener, Diego Perez, Spyridon Samothrakis and Simon Colton Abstract—Monte Carlo Tree Search (MCTS) is a recently proposed search method that combines the precision of tree search with the generality of random sampling. It has received considerable interest due to its spectacular success in the difficult problem of computer Go, but has also proved beneficial in a range of other domains. This paper is a survey of the literature to date, intended to provide a snapshot of the state of the art after the first five years of MCTS research. We outline the core algorithm’s derivation, impart some structure on the many variations and enhancements that have been proposed, and summarise the results from the key game and non-game domains to which MCTS methods have been applied. A number of open research questions indicate that the field is ripe for future work. Index Terms—Monte Carlo Tree Search (MCTS), Upper Confidence Bounds (UCB), Upper Confidence Bounds for Trees (UCT), Bandit-based methods, Artificial Intelligence (AI), Game search, Computer Go. F 1 INTRODUCTION ONTE Carlo Tree Search (MCTS) is a method for M finding optimal decisions in a given domain by taking random samples in the decision space and build- ing a search tree according to the results. It has already had a profound impact on Artificial Intelligence (AI) approaches for domains that can be represented as trees of sequential decisions, particularly games and planning problems.
    [Show full text]
  • Ohio Chess Bulletin
    Ohio Chess Bulletin Volume 68 September 2015 Number 4 OCA Officers The Ohio Chess Bulletin published by the President: Evan Shelton 8241 Turret Dr., Ohio Chess Association Blacklick OH 43004 (614)-425-6514 Visit the OCA Web Site at http://www.ohiochess.org [email protected] Ohio Chess Association Trustees Vice President: Michael D. Joelson 12200 Fairhill Rd - E293 District Trustee Contact Information Cleveland, OH 44120 1 Cuneyd 5653 Olde Post Rd [email protected] Tolek Syvania OH 43560 (419) 376-7891 Secretary: Grant Neilley [email protected] 2720 Airport Drive Columbus, OH 43219-2219 2 Michael D. 12200 Fairhill Rd - E293 (614)-418-1775 Joelson Cleveland, OH 44120 [email protected] [email protected] Treasurer/Membership Chair: 3 John 2664 Pine Shore Drive Cheryl Stagg Dowling Lima OH 45806 7578 Chancery Dr. [email protected] Dublin, OH 43016 (614) 282-2151 4 Eric 1799 Franklin Ave [email protected] Gittrich Columbus OH. 43205 (614)-843-4300 OCB Editor: Michael L. Steve [email protected] 3380 Brandonbury Way Columbus, OH 43232-6170 5 Joseph E. 7125 Laurelview Circle NE (614) 833-0611 Yun Canton, OH 44721-2851 [email protected] (330) 492-8332 [email protected] Inside this issue... 6 Riley D. 18 W. Fifth Street – Mezzanine Driver Dayton OH 45402 Points of Contact 2 (937) 461-6283 Message from the President 3 [email protected] Editor Note/Correction 4 2014/2015 Ohio Grand Prix 7 Steve 1383 Fairway Dr. Final Standings 4 Charles Grove City OH 43123 MOTCF Addendum 5 (614) 309-9028
    [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]
  • Dream Jobs 2008 Sigrid Close Studies Shooting Stars with the World’S Biggest Radars Australia’S Transcontinental Solar Car Race Wireless’S Virgin Territory
    Contents | Zoom in | Zoom out For navigation instructions please click here Search Issue | Next Page THE MAGAZINE OF TECHNOLOGY INSIDERS 02.08 SPECIAL ISSUE: DREAM JOBS 2008 SIGRID CLOSE STUDIES SHOOTING STARS WITH THE WORLD’S BIGGEST RADARS AUSTRALIA’S TRANSCONTINENTAL SOLAR CAR RACE WIRELESS’S VIRGIN TERRITORY Contents | Zoom in | Zoom out For navigation instructions please click here Search Issue | Next Page A SPECTRUM Previous Page | Contents | Zoom in | Zoom out | Front Cover | Search Issue | Next Page BEF MaGS _______________ A SPECTRUM Previous Page | Contents | Zoom in | Zoom out | Front Cover | Search Issue | Next Page BEF MaGS A SPECTRUM Previous Page | Contents | Zoom in | Zoom out | Front Cover | Search Issue | Next Page BEF MaGS volume 45 number 2 international 02.08 FRONT UPDATE 7 CANCER SCREENING IN A TANGLE A controversial breast-cancer technology is coming to market. By Morgen E. Peck 8 BIG JUMP IN MICRO- PROCESSOR MATH 9 REINVENTING THE WHEEL 10 CAN WIND ENERGY KEEP GROWING? 11 ELECTRONIC GENE THERAPY 12 BRAKE-BY-WIRE FOR FREIGHT TRAINS 14 THE BIG PICTURE Cranial calculations. OPINION 5 SPECTRAL LINES Format wars at the Consumer Electronics Show: one down, more to go. 6 FORUM The (relative) safety of Tasers, the tainting of online gaming, and measuring entropy. 21 TECHNICALLY SPEAKING The snowclone: A higher-order cliché? THE EXTRA SPECIAL REPORT By Paul McFedries MILE: David Downey designs and then fi eld- 23 DREAM JOBS 2008 DEPARTMENTS tests fi tness When your day job is this much fun, can you really call it “work”? 3 CONTRIBUTORS products; Roger Hill builds 4 BACK STORY computers to 40 GADGETS GAB AT 60 GHz track penguins in To juggle gigabits of high-defi nition video, wireless networks 17 CAREERS Antarctica; must move way, way up the spectrum.
    [Show full text]
  • Speech-Language Services in Arizona Schools: Guidelines for Best Practice
    Arizona Department of Education Diane M. Douglas, Superintendent of Public Instruction Exceptional Student Services Arizona Technical Assistance System (AZ-TAS) Speech-Language Services in Arizona’s Schools: Guidelines for Best Practice Speech-Language Services in Arizona’s Schools: Guidelines for Best Practices September 2016 Table of Contents Introduction ................................................................................................................................. i Acknowledgements .....................................................................................................................ii Commonly Used Acronyms…………………………………………………………………………………..…….….……..iii Overview of School-Based Speech-Language Pathology...................................................... 1 Role of the School-Based Speech-Language Pathologist/Technician ......................................... 1 Federal and Arizona Definitions of Students with Disabilities.................................................... 1 Speech-Language Pathologists/Speech-Language Technicians ................................................. 4 Speech-Language Pathology Assistants (SLPAs) ......................................................................... 7 Substitutes and Vacancies .......................................................................................................... 9 Supervision and Mentoring ...................................................................................................... 10 Recruiting and Retaining Qualified
    [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]