DOCSLIB.ORG

By Arend Bayer, Daniel Bump, Evan Berggren Daniel, David Denholm

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
By Arend Bayer, Daniel Bump, Evan Berggren Daniel, David Denholm Documentation for the GNU Go Project Edition 3.8 July, 2003 By Arend Bayer, Daniel Bump, Evan Berggren Daniel, David Denholm, Jerome Dumonteil, Gunnar Farneb¨ack, Paul Pogonyshev, Thomas Traber, Tanguy Urvoy, Inge Wallin GNU Go 3.8 Copyright c 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007 and 2008 Free Software Foundation, Inc. This is Edition 3.8 of The GNU Go Project documentation, for the 3.8 version of the GNU Go program. Published by the Free Software Foundation Inc 51 Franklin Street, Fifth Floor Boston, MA 02110-1301 USA Tel: 617-542-5942 Permission is granted to make and distribute verbatim or modified copies of this manual is given provided that the terms of the GNU Free Documentation License (see Section A.5 [GFDL], page 218, version 1.3 or any later version) are respected. Permission is granted to make and distribute verbatim or modified copies of the program GNU Go is given provided the terms of the GNU General Public License (see Section A.1 [GPL], page 207, version 3 or any later version) are respected. i Table of Contents ::::::::::::::::::::::::::::::::::::::::::::::::::::::: 1 1 Introduction::::::::::::::::::::::::::::::::::::: 2 1.1 About GNU Go and this Manual ::::::::::::::::::::::::::::::: 2 1.2 Copyrights ::::::::::::::::::::::::::::::::::::::::::::::::::::: 2 1.3 Authors :::::::::::::::::::::::::::::::::::::::::::::::::::::::: 3 1.4 Thanks :::::::::::::::::::::::::::::::::::::::::::::::::::::::: 3 1.5 Development ::::::::::::::::::::::::::::::::::::::::::::::::::: 3 2 Installation :::::::::::::::::::::::::::::::::::::: 5 2.1 GNU/Linux and Unix :::::::::::::::::::::::::::::::::::::::::: 5 2.2 Configure Options:::::::::::::::::::::::::::::::::::::::::::::: 5 2.2.1 Ram Cache ::::::::::::::::::::::::::::::::::::::::::::::: 6 2.2.2 Default Level:::::::::::::::::::::::::::::::::::::::::::::: 6 2.2.3 Other Options::::::::::::::::::::::::::::::::::::::::::::: 6 2.3 Compiling GNU Go on Microsoft platforms ::::::::::::::::::::: 7 2.3.1 Windows 95/98, MS-DOS and Windows 3.x using DJGPP :: 8 2.3.2 Windows NT, 2000, XP, 95/98/ME using Cygwin:::::::::: 8 2.3.3 Windows NT, 2000, XP, 95/98/ME using MinGW32 ::::::: 9 2.3.4 Windows NT, Windows 95/98 using Visual C and project files ::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 9 2.3.5 Running GNU Go on Windows NT and Windows 95/98 :: 10 2.4 Macintosh :::::::::::::::::::::::::::::::::::::::::::::::::::: 10 3 Using GNU Go :::::::::::::::::::::::::::::::: 11 3.1 Getting Documentation ::::::::::::::::::::::::::::::::::::::: 11 3.2 Running GNU Go via CGoban :::::::::::::::::::::::::::::::: 11 3.3 Other Clients ::::::::::::::::::::::::::::::::::::::::::::::::: 12 3.4 Ascii Interface :::::::::::::::::::::::::::::::::::::::::::::::: 13 3.5 GNU Go mode in Emacs :::::::::::::::::::::::::::::::::::::: 13 3.6 The Go Modem Protocol and Go Text Protocol ::::::::::::::: 13 3.7 Computer Go Tournaments ::::::::::::::::::::::::::::::::::: 14 3.8 Smart Game Format :::::::::::::::::::::::::::::::::::::::::: 14 3.9 Invoking GNU Go: Command line options::::::::::::::::::::: 14 3.9.1 Some basic options ::::::::::::::::::::::::::::::::::::::: 14 3.9.2 Monte Carlo Options ::::::::::::::::::::::::::::::::::::: 15 3.9.3 Other general options :::::::::::::::::::::::::::::::::::: 16 3.9.4 Other options affecting strength and speed:::::::::::::::: 17 3.9.5 Ascii mode options ::::::::::::::::::::::::::::::::::::::: 19 3.9.6 Development options ::::::::::::::::::::::::::::::::::::: 19 3.9.7 Experimental options::::::::::::::::::::::::::::::::::::: 23 ii 4 GNU Go engine overview::::::::::::::::::::: 24 4.1 Gathering Information :::::::::::::::::::::::::::::::::::::::: 24 4.2 Move Generators :::::::::::::::::::::::::::::::::::::::::::::: 25 4.3 Move Valuation ::::::::::::::::::::::::::::::::::::::::::::::: 26 4.4 Detailed Sequence of Events ::::::::::::::::::::::::::::::::::: 27 4.5 Roadmap ::::::::::::::::::::::::::::::::::::::::::::::::::::: 29 4.5.1 Files in `engine/' :::::::::::::::::::::::::::::::::::::::: 29 4.5.2 Files in `patterns/' :::::::::::::::::::::::::::::::::::::: 32 4.6 Coding styles and conventions ::::::::::::::::::::::::::::::::: 34 4.6.1 Coding Conventions :::::::::::::::::::::::::::::::::::::: 34 4.6.2 Tracing :::::::::::::::::::::::::::::::::::::::::::::::::: 34 4.6.3 Assertions:::::::::::::::::::::::::::::::::::::::::::::::: 35 4.6.4 FIXME :::::::::::::::::::::::::::::::::::::::::::::::::: 35 4.7 Navigating the Source ::::::::::::::::::::::::::::::::::::::::: 35 5 Analyzing GNU Go's moves :::::::::::::::::: 36 5.1 Interpreting Traces:::::::::::::::::::::::::::::::::::::::::::: 36 5.2 The Output File :::::::::::::::::::::::::::::::::::::::::::::: 36 5.3 Checking the reading code :::::::::::::::::::::::::::::::::::: 36 5.4 Checking the Owl Code ::::::::::::::::::::::::::::::::::::::: 37 5.5 GTP and GDB techniques :::::::::::::::::::::::::::::::::::: 38 5.6 Debugging on a Graphical Board :::::::::::::::::::::::::::::: 38 5.7 Scoring the game:::::::::::::::::::::::::::::::::::::::::::::: 38 5.8 Colored Display ::::::::::::::::::::::::::::::::::::::::::::::: 38 5.8.1 Dragon Display :::::::::::::::::::::::::::::::::::::::::: 38 5.8.2 Eye Space Display:::::::::::::::::::::::::::::::::::::::: 39 6 Move generation ::::::::::::::::::::::::::::::: 40 6.1 Introduction :::::::::::::::::::::::::::::::::::::::::::::::::: 40 6.2 Generation of move reasons ::::::::::::::::::::::::::::::::::: 40 6.3 Detailed Descriptions of various Move Reasons :::::::::::::::: 42 6.3.1 Attacking and defending moves ::::::::::::::::::::::::::: 42 6.3.2 Threats to Attack or Defend:::::::::::::::::::::::::::::: 42 6.3.3 Multiple attack or defense moves ::::::::::::::::::::::::: 42 6.3.4 Cutting and connecting moves :::::::::::::::::::::::::::: 42 6.3.5 Semeai winning moves:::::::::::::::::::::::::::::::::::: 43 6.3.6 Making or destroying eyes :::::::::::::::::::::::::::::::: 43 6.3.7 Antisuji moves ::::::::::::::::::::::::::::::::::::::::::: 43 6.3.8 Territorial moves ::::::::::::::::::::::::::::::::::::::::: 43 6.3.9 Attacking and Defending Dragons :::::::::::::::::::::::: 43 6.3.10 Combination Attacks:::::::::::::::::::::::::::::::::::: 44 6.4 Valuation of suggested moves:::::::::::::::::::::::::::::::::: 44 6.4.1 Territorial Value ::::::::::::::::::::::::::::::::::::::::: 45 6.4.2 Strategical Value ::::::::::::::::::::::::::::::::::::::::: 45 6.4.3 Shape Factor ::::::::::::::::::::::::::::::::::::::::::::: 45 6.4.4 Minimum Value :::::::::::::::::::::::::::::::::::::::::: 45 6.4.5 Secondary Value ::::::::::::::::::::::::::::::::::::::::: 46 iii 6.4.6 Threats and Followup Value :::::::::::::::::::::::::::::: 46 6.5 End Game :::::::::::::::::::::::::::::::::::::::::::::::::::: 46 7 Worms and Dragons :::::::::::::::::::::::::: 47 7.1 Worms:::::::::::::::::::::::::::::::::::::::::::::::::::::::: 47 7.2 Amalgamation :::::::::::::::::::::::::::::::::::::::::::::::: 51 7.3 Connection ::::::::::::::::::::::::::::::::::::::::::::::::::: 52 7.4 Half Eyes and False Eyes :::::::::::::::::::::::::::::::::::::: 53 7.5 Dragons :::::::::::::::::::::::::::::::::::::::::::::::::::::: 54 7.6 Colored Dragon Display ::::::::::::::::::::::::::::::::::::::: 59 8 Eyes and Half Eyes :::::::::::::::::::::::::::: 60 8.1 Local games :::::::::::::::::::::::::::::::::::::::::::::::::: 60 8.2 Eye spaces :::::::::::::::::::::::::::::::::::::::::::::::::::: 60 8.3 The eyespace as local game:::::::::::::::::::::::::::::::::::: 61 8.4 An example ::::::::::::::::::::::::::::::::::::::::::::::::::: 63 8.5 Graphs ::::::::::::::::::::::::::::::::::::::::::::::::::::::: 64 8.6 Eye shape analysis :::::::::::::::::::::::::::::::::::::::::::: 65 8.7 Eye Local Game Values ::::::::::::::::::::::::::::::::::::::: 66 8.8 Topology of Half Eyes and False Eyes ::::::::::::::::::::::::: 67 8.9 Eye Topology with Ko :::::::::::::::::::::::::::::::::::::::: 68 8.10 False Margins :::::::::::::::::::::::::::::::::::::::::::::::: 72 8.11 Functions in `optics.c' :::::::::::::::::::::::::::::::::::::: 72 9 The Pattern Code ::::::::::::::::::::::::::::: 77 9.1 Overview ::::::::::::::::::::::::::::::::::::::::::::::::::::: 77 9.2 Pattern Attributes :::::::::::::::::::::::::::::::::::::::::::: 78 9.2.1 Constraint Pattern Attributes :::::::::::::::::::::::::::: 78 9.2.2 Action Attributes :::::::::::::::::::::::::::::::::::::::: 79 9.3 Pattern Attributes :::::::::::::::::::::::::::::::::::::::::::: 80 9.4 Helper Functions :::::::::::::::::::::::::::::::::::::::::::::: 81 9.5 Autohelpers and Constraints :::::::::::::::::::::::::::::::::: 82 9.6 Autohelper Actions ::::::::::::::::::::::::::::::::::::::::::: 83 9.7 Autohelper Functions ::::::::::::::::::::::::::::::::::::::::: 84 9.8 Attack and Defense Database ::::::::::::::::::::::::::::::::: 90 9.9 The Connections Database :::::::::::::::::::::::::::::::::::: 90 9.10 Connections Functions ::::::::::::::::::::::::::::::::::::::: 92 9.11 Tuning the Pattern databases :::::::::::::::::::::::::::::::: 92 9.12 Implementation :::::::::::::::::::::::::::::::::::::::::::::: 95 9.13 Symmetry and transformations::::::::::::::::::::::::::::::: 95 9.14 Implementation Details :::::::::::::::::::::::::::::::::::::: 96 9.15 The \Grid" Optimization :::::::::::::::::::::::::::::::::::: 97 9.16 The Joseki Compiler ::::::::::::::::::::::::::::::::::::::::: 98 9.17 Ladders in Joseki :::::::::::::::::::::::::::::::::::::::::::: 99 9.18 Corner Matcher::::::::::::::::::::::::::::::::::::::::::::: 100 9.19 Emacs Mode for Editing Patterns ::::::::::::::::::::::::::: 102 iv 10 The DFA pattern matcher ::::::::::::::::: 103 10.1
Load more

Recommended publications
  • Openbsd Gaming Resource
    OPENBSD GAMING RESOURCE A continually updated resource for playing video games on OpenBSD. Mr. Satterly Updated August 7, 2021 P11U17A3B8 III Title: OpenBSD Gaming Resource Author: Mr. Satterly Publisher: Mr. Satterly Date: Updated August 7, 2021 Copyright: Creative Commons Zero 1.0 Universal Email: [email protected] Website: https://MrSatterly.com/ Contents 1 Introduction1 2 Ways to play the games2 2.1 Base system........................ 2 2.2 Ports/Editors........................ 3 2.3 Ports/Emulators...................... 3 Arcade emulation..................... 4 Computer emulation................... 4 Game console emulation................. 4 Operating system emulation .............. 7 2.4 Ports/Games........................ 8 Game engines....................... 8 Interactive fiction..................... 9 2.5 Ports/Math......................... 10 2.6 Ports/Net.......................... 10 2.7 Ports/Shells ........................ 12 2.8 Ports/WWW ........................ 12 3 Notable games 14 3.1 Free games ........................ 14 A-I.............................. 14 J-R.............................. 22 S-Z.............................. 26 3.2 Non-free games...................... 31 4 Getting the games 33 4.1 Games............................ 33 5 Former ways to play games 37 6 What next? 38 Appendices 39 A Clones, models, and variants 39 Index 51 IV 1 Introduction I use this document to help organize my thoughts, files, and links on how to play games on OpenBSD. It helps me to remember what I have gone through while finding new games. The biggest reason to read or at least skim this document is because how can you search for something you do not know exists? I will show you ways to play games, what free and non-free games are available, and give links to help you get started on downloading them.
    [Show full text]
  • Lesson Plans for Go in Schools
    Go Lesson Plans 1 Lesson Plans for Go in Schools By Gordon E. Castanza, Ed. D. October 19, 2011 Published By Rittenberg Consulting Group 7806 108th St. NW Gig Harbor, WA 98332 253-853-4831 ©Gordon E. Castanza, Ed. D. 10/19/11 DRAFT Go Lesson Plans 2 Table of Contents Acknowledgements ......................................................................................................................... 4 Purpose/Rationale ........................................................................................................................... 5 Lesson Plan One ............................................................................................................................. 7 Basic Ideas .................................................................................................................................. 7 Introduction ............................................................................................................................... 11 The Puzzle ................................................................................................................................. 13 Surround to Capture .................................................................................................................. 14 First Capture Go ........................................................................................................................ 16 Lesson Plan Two ........................................................................................................................... 19 Units &
    [Show full text]
  • DVD-Libre 2005-04 Y 2 Pr W W Pr B - 3 T T T T S De Ca SI 5 Sc Re Ra Q 1 Po 3 Ph I Sa Dic Dic 2 4 W Ex ( H N C T
    (continuación) - CDCheck 3.1.4.0 - CDex 1.51 - Celestia 1.3.2 - Centarsia 1.3 - Chain Reaction - Check4me 2.03 - Checky 2.5 - Chomp 1.4.5 - ClamWin 0.83 - Clan Bomber 1.05 - Cobian Backup 6.1.1.264 - Cobian Internet Tools 1.0.0.10 - ColorCop 5.3 - ColorWiz 1.0 - Combinaisons Junior Plus 2.70 - Continental 2.1 - Crack Attack! 1.1.08 - Crimson Editor 3.70 - CubeTest 0.9.3 - DBDesigner 4.0.5.6 - DeepBurner 1.3.6.168 - Deslizzzp 3.3 - Dev-C++ 4.9.9.2 - Dia Win32 0.94 - DirGraph 2.0 - DVD-Libre Disk Imager 1.4 - Domino Puzzle 0.1a - DominOSA 1.71 - DomiSol 1.2 - Doxygen 1.4.1 - Dragonboard 0.8c - Drawing for children 2.0 - DVD Identifier 3.6.2 - e-Counter 3.1.2004 - EasyISO 1.3 - EasyPHP cdlibre.org 1.8 - Eclipse 3.0.1 - Eclipse Language Pack 3.0.x - Eclipse Modeling Framework 2.0.1 - Eclipse Visual Editor 1.0.2 - Emilia Pinball 0.30c - Enigma 0.81 - EQTabla 4.0.050208 - Eraser 5.7 - Everest 2005-04 Dictionary 3.10 beta - Everest Dictionary 3.10 beta Completo - Exact Audio Copy 0.95 prebeta 5 - Exodus 0.9.0.0 - Fall - FileMenu Tools 4.1 - FileZilla 2.2.12a - Find Favorites 1.11 - Firebird 1.5.2 - Flexible Renamer 7.3 - FloboPuyo 0.20 - FolderQuote 1.0 - foobar2000 0.8.3 - FooBilliard 3.0 - Foxit PDF Reader 1.2.0.115 - FractalExplorer 2.02 - FractalForge 2.8.2 - FrameFun 1.0.5.0 - Free Download DVD-Libre es una recopilación de programas para Windows: Manager 1.5.256 - Free Pascal 1.0.10 - FreeCiv 1.14.2 - FreeMind 0.7.1 - Frozen Bubble Enhanced ● libres / gratuitos al menos para uso personal o educativo 1.0 - Gaim 1.1.4 - GanttProject 1.10.3
    [Show full text]
  • CSC321 Lecture 23: Go
    CSC321 Lecture 23: Go Roger Grosse Roger Grosse CSC321 Lecture 23: Go 1 / 22 Final Exam Monday, April 24, 7-10pm A-O: NR 25 P-Z: ZZ VLAD Covers all lectures, tutorials, homeworks, and programming assignments 1/3 from the first half, 2/3 from the second half If there's a question on this lecture, it will be easy Emphasis on concepts covered in multiple of the above Similar in format and difficulty to the midterm, but about 3x longer Practice exams will be posted Roger Grosse CSC321 Lecture 23: Go 2 / 22 Overview Most of the problem domains we've discussed so far were natural application areas for deep learning (e.g. vision, language) We know they can be done on a neural architecture (i.e. the human brain) The predictions are inherently ambiguous, so we need to find statistical structure Board games are a classic AI domain which relied heavily on sophisticated search techniques with a little bit of machine learning Full observations, deterministic environment | why would we need uncertainty? This lecture is about AlphaGo, DeepMind's Go playing system which took the world by storm in 2016 by defeating the human Go champion Lee Sedol Roger Grosse CSC321 Lecture 23: Go 3 / 22 Overview Some milestones in computer game playing: 1949 | Claude Shannon proposes the idea of game tree search, explaining how games could be solved algorithmically in principle 1951 | Alan Turing writes a chess program that he executes by hand 1956 | Arthur Samuel writes a program that plays checkers better than he does 1968 | An algorithm defeats human novices at Go 1992
    [Show full text]
  • Residual Networks for Computer Go Tristan Cazenave
    Residual Networks for Computer Go Tristan Cazenave To cite this version: Tristan Cazenave. Residual Networks for Computer Go. IEEE Transactions on Games, Institute of Electrical and Electronics Engineers, 2018, 10 (1), 10.1109/TCIAIG.2017.2681042. hal-02098330 HAL Id: hal-02098330 https://hal.archives-ouvertes.fr/hal-02098330 Submitted on 12 Apr 2019 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. IEEE TCIAIG 1 Residual Networks for Computer Go Tristan Cazenave Universite´ Paris-Dauphine, PSL Research University, CNRS, LAMSADE, 75016 PARIS, FRANCE Deep Learning for the game of Go recently had a tremendous success with the victory of AlphaGo against Lee Sedol in March 2016. We propose to use residual networks so as to improve the training of a policy network for computer Go. Training is faster than with usual convolutional networks and residual networks achieve high accuracy on our test set and a 4 dan level. Index Terms—Deep Learning, Computer Go, Residual Networks. I. INTRODUCTION Input EEP Learning for the game of Go with convolutional D neural networks has been addressed by Clark and Storkey [1]. It has been further improved by using larger networks [2].
    [Show full text]
  • E-Book? Začala Hra
    Nejlepší strategie všech dob 1 www.yohama.cz Nejlepší strategie všech dob Obsah OBSAH DESKOVÁ HRA GO ................................................................................................................................ 3 Úvod ............................................................................................................................................................ 3 Co je to go ................................................................................................................................................... 4 Proč hrát go ................................................................................................................................................. 7 Kde získat go ................................................................................................................................................ 9 Jak začít hrát go ......................................................................................................................................... 10 Kde a s kým hrát go ................................................................................................................................... 12 Jak se zlepšit v go ...................................................................................................................................... 14 Handicapová hra ....................................................................................................................................... 15 Výkonnostní třídy v go a rating hráčů .......................................................................................................
    [Show full text]
  • FUEGO—An Open-Source Framework for Board Games and Go Engine Based on Monte Carlo Tree Search Markus Enzenberger, Martin Müller, Broderick Arneson, and Richard Segal
    IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES, VOL. 2, NO. 4, DECEMBER 2010 259 FUEGO—An Open-Source Framework for Board Games and Go Engine Based on Monte Carlo Tree Search Markus Enzenberger, Martin Müller, Broderick Arneson, and Richard Segal Abstract—FUEGO is both an open-source software framework with new algorithms that would not be possible otherwise be- and a state-of-the-art program that plays the game of Go. The cause of the cost of implementing a complete state-of-the-art framework supports developing game engines for full-information system. Successful previous examples show the importance of two-player board games, and is used successfully in a substantial open-source software: GNU GO [19] provided the first open- number of projects. The FUEGO Go program became the first program to win a game against a top professional player in 9 9 source Go program with a strength approaching that of the best Go. It has won a number of strong tournaments against other classical programs. It has had a huge impact, attracting dozens programs, and is competitive for 19 19 as well. This paper gives of researchers and hundreds of hobbyists. In Chess, programs an overview of the development and current state of the UEGO F such as GNU CHESS,CRAFTY, and FRUIT have popularized in- project. It describes the reusable components of the software framework and specific algorithms used in the Go engine. novative ideas and provided reference implementations. To give one more example, in the field of domain-independent planning, Index Terms—Computer game playing, Computer Go, FUEGO, systems with publicly available source code such as Hoffmann’s man-machine matches, Monte Carlo tree search, open source soft- ware, software frameworks.
    [Show full text]
  • Achieving Master Level Play in 9X9 Computer Go
    Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (2008) Achieving Master Level Play in 9 9 Computer Go × Sylvain Gelly∗ David Silver† Univ. Paris Sud, LRI, CNRS, INRIA, France University of Alberta, Edmonton, Alberta, Canada Abstract simulated, using self-play, starting from the current position. Each position in the search tree is evaluated by the average The UCT algorithm uses Monte-Carlo simulation to estimate outcome of all simulated games that pass through that po- the value of states in a search tree from the current state. However, the first time a state is encountered, UCT has no sition. The search tree is used to guide simulations along knowledge, and is unable to generalise from previous expe- promising paths. This results in a highly selective search rience. We describe two extensions that address these weak- that is grounded in simulated experience, rather than an ex- nesses. Our first algorithm, heuristic UCT, incorporates prior ternal heuristic. Programs using UCT search have outper- knowledge in the form of a value function. The value function formed all previous Computer Go programs (Coulom 2006; can be learned offline, using a linear combination of a million Gelly et al. 2006). binary features, with weights trained by temporal-difference Monte-Carlo tree search algorithms suffer from two learning. Our second algorithm, UCT–RAVE, forms a rapid sources of inefficiency. First, when a position is encoun- online generalisation based on the value of moves. We ap- tered for the first time, no knowledge is available to guide plied our algorithms to the domain of 9 9 Computer Go, the search.
    [Show full text]
  • Computer Go: from the Beginnings to Alphago Martin Müller, University of Alberta
    Computer Go: from the Beginnings to AlphaGo Martin Müller, University of Alberta 2017 Outline of the Talk ✤ Game of Go ✤ Short history - Computer Go from the beginnings to AlphaGo ✤ The science behind AlphaGo ✤ The legacy of AlphaGo The Game of Go Go ✤ Classic two-player board game ✤ Invented in China thousands of years ago ✤ Simple rules, complex strategy ✤ Played by millions ✤ Hundreds of top experts - professional players ✤ Until 2016, computers weaker than humans Go Rules ✤ Start with empty board ✤ Place stone of your own color ✤ Goal: surround empty points or opponent - capture ✤ Win: control more than half the board Final score, 9x9 board ✤ Komi: first player advantage Measuring Go Strength ✤ People in Europe and America use the traditional Japanese ranking system ✤ Kyu (student) and Dan (master) levels ✤ Separate Dan ranks for professional players ✤ Kyu grades go down from 30 (absolute beginner) to 1 (best) ✤ Dan grades go up from 1 (weakest) to about 6 ✤ There is also a numerical (Elo) system, e.g. 2500 = 5 Dan Short History of Computer Go Computer Go History - Beginnings ✤ 1960’s: initial ideas, designs on paper ✤ 1970’s: first serious program - Reitman & Wilcox ✤ Interviews with strong human players ✤ Try to build a model of human decision-making ✤ Level: “advanced beginner”, 15-20 kyu ✤ One game costs thousands of dollars in computer time 1980-89 The Arrival of PC ✤ From 1980: PC (personal computers) arrive ✤ Many people get cheap access to computers ✤ Many start writing Go programs ✤ First competitions, Computer Olympiad, Ing Cup ✤ Level 10-15 kyu 1990-2005: Slow Progress ✤ Slow progress, commercial successes ✤ 1990 Ing Cup in Beijing ✤ 1993 Ing Cup in Chengdu ✤ Top programs Handtalk (Prof.
    [Show full text]
  • Walnut Creek CDROM Spring 1995 Catalog 1-800-786-9907 • 1-510-674-0821 Fax the Best of Walnut Creek CDROM Is Yours Free*
    Walnut Creek CDROM Spring 1995 Catalog 1-800-786-9907 • 1-510-674-0821 Fax The Best of Walnut Creek CDROM is yours Free*. The • You’ll also get fonts, fractals, Best of Walnut Creek CDROM music, clipart, and more. 600 lets you explore in-depth what MegaBytes in total! Walnut Creek CDROM has to offer. • Boot images from our Unix for PC discs so you will With samples from all of our know if your hardware will products, you’ll be able to see boot Slackware Linux or what our CDROM’s will do for FreeBSD you, before you buy. This CDROM contains: • The Walnut Creek CDROM digital catalog - photos and • Index listings of all the descriptions of our all titles programs, photos, and files on all Walnut Creek CDROM If you act now, we’ll include titles $5.00 good toward the purchase of all Walnut Creek CDROM • The best from each disc titles. If you’re only going to including Hobbes OS/2, own one CDROM, this should CICA MS Windows, Simtel be it! March, 1995. MSDOS, Giga Games, Internet Info, Teacher 2000, Call, write, fax, or email your Ultra Mac-Games and Ultra order to us today! Mac-Utilities * The disc is without cost, but the regular shipping charge still applies. • You get applications, games, utilities, photos, gifs, documents, ray-tracings, and animations 2 CALL NOW! 1-800-786-9907 Phone: +1-510-674-0783 • Fax: +1-510-674-0821 • Email: [email protected] • WWW: http://WWW.cdrom.com/ (Alphabetical Index on page 39.) Hi, Sampler - (Best of Walnut Creek) 2 This is Jack and I’ve got another great batch of CICA for Windows 4 Music Workshop 5 CDROM’s for you.
    [Show full text]
  • GO WINDS Play Over 1000 Professional Games to Reach Recent Sets Have Focused on "How the Pros 1-Dan, It Is Said
    NEW FROM YUTOPIAN ENTERPRISES GO GAMES ON DISK (GOGoD) SOFTWARE GO WINDS Play over 1000 professional games to reach Recent sets have focused on "How the pros 1-dan, it is said. How about 6-dan? Games of play the ...". So far there are sets covering the Go on Disk now offers over 6000 professional "Chinese Fuseki" Volume I (a second volume Volume 2 Number 4 Winter 1999 $3.00 games on disk, games that span the gamut of is in preparation), and "Nirensei", Volumes I go history - featuring players that helped and II. A "Sanrensei" volume is also in define the history. preparation. All these disks typically contain All game collections come with DOS or 300 games. Windows 95 viewing software, and most The latest addition to this series is a collections include the celebrated Go Scorer in "specialty" item - so special GoGoD invented which you can guess the pros' moves as you a new term for it. It is the "Sideways Chinese" play (with hints if necessary) and check your fuseki, which incorporates the Mini-Chinese score. pattern. Very rarely seen in western The star of the collection may well be "Go publications yet played by most of the top Seigen" - the lifetime games (over 800) of pros, this opening is illustrated by over 130 perhaps the century's greatest player, with games from Japan, China and Korea. Over more than 10% commented. "Kitani" 1000 half have brief comments. The next specialty makes an ideal matching set - most of the item in preparation is a set of games featuring lifetime games of his legendary rival, Kitani unusual fusekis - this will include rare New Minoru.
    [Show full text]
  • Reinforcement Learning of Local Shape in the Game of Go
    Reinforcement Learning of Local Shape in the Game of Go David Silver, Richard Sutton, and Martin Muller¨ Department of Computing Science University of Alberta Edmonton, Canada T6G 2E8 {silver, sutton, mmueller}@cs.ualberta.ca Abstract effective. They are fast to compute; easy to interpret, modify and debug; and they have good convergence properties. We explore an application to the game of Go of Secondly, weights are trained by temporal difference learn- a reinforcement learning approach based on a lin- ing and self-play. The world champion Checkers program ear evaluation function and large numbers of bi- Chinook was hand-tuned by expert players over 5 years. nary features. This strategy has proved effective When weights were trained instead by self-play using a tem- in game playing programs and other reinforcement poral difference learning algorithm, the program equalled learning applications. We apply this strategy to Go the performance of the original version [7]. A similar ap- by creating over a million features based on tem- proach attained master level play in Chess [1]. TD-Gammon plates for small fragments of the board, and then achieved world class Backgammon performance after train- use temporal difference learning and self-play. This ingbyTD(0)andself-play[13]. A program trained by method identifies hundreds of low level shapes with TD(λ) and self-play outperformed an expert, hand-tuned ver- recognisable significance to expert Go players, and sion at the card game Hearts [11]. Experience generated provides quantitive estimates of their values. We by self-play was also used to train the weights of the world analyse the relative contributions to performance of champion Othello and Scrabble programs, using least squares templates of different types and sizes.
    [Show full text]