Solving the Game of Checkers
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
University of Alberta Library Release
University of Alberta Library Release Form Name of Author: Morgan Hugh Kan Title of Thesis: Postgame Analysis of Poker Decisions Degree: Master of Science Year this Degree Granted: 2007 Permission is hereby granted to the University of Alberta Library to reproduce sin- gle copies of this thesis and to lend or sell such copies for private, scholarly or scientific research purposes only. The author reserves all other publication and other rights in association with the copyright in the thesis, and except as herein before provided, neither the thesis nor any substantial portion thereof may be printed or otherwise reproduced in any material form whatever without the author's prior written permission. Morgan Hugh Kan Date: University of Alberta POSTGAME ANALYSIS OF POKER DECISIONS by Morgan Hugh Kan A thesis submitted to the Faculty of Graduate Studies and Research in partial ful- fillment of the requirements for the degree of Master of Science. Department of Computing Science Edmonton, Alberta Spring 2007 University of Alberta Faculty of Graduate Studies and Research The undersigned certify that they have read, and recommend to the Faculty of Grad- uate Studies and Research for acceptance, a thesis entitled Postgame Analysis of Poker Decisions submitted by Morgan Hugh Kan in partial fulfillment of the re- quirements for the degree of Master of Science. Jonathan Schaeffer Supervisor Michael Bowling Michael Carbonaro External Examiner Date: To my parents, Janet and Chay Kan, and my sister, Megan Kan, I would never have made it this far without them. Abstract In Artificial Intelligence research, evaluation is a recurring theme. A newly crafted game-playing program is interesting if it can be shown to be better by some mea- sure. -
Games Ancient and Oriental and How to Play Them, Being the Games Of
CO CD CO GAMES ANCIENT AND ORIENTAL AND HOW TO PLAY THEM. BEING THE GAMES OF THE ANCIENT EGYPTIANS THE HIERA GRAMME OF THE GREEKS, THE LUDUS LATKUNCULOKUM OF THE ROMANS AND THE ORIENTAL GAMES OF CHESS, DRAUGHTS, BACKGAMMON AND MAGIC SQUAEES. EDWARD FALKENER. LONDON: LONGMANS, GEEEN AND Co. AND NEW YORK: 15, EAST 16"' STREET. 1892. All rights referred. CONTENTS. I. INTRODUCTION. PAGE, II. THE GAMES OF THE ANCIENT EGYPTIANS. 9 Dr. Birch's Researches on the games of Ancient Egypt III. Queen Hatasu's Draught-board and men, now in the British Museum 22 IV. The of or the of afterwards game Tau, game Robbers ; played and called by the same name, Ludus Latrunculorum, by the Romans - - 37 V. The of Senat still the modern and game ; played by Egyptians, called by them Seega 63 VI. The of Han The of the Bowl 83 game ; game VII. The of the Sacred the Hiera of the Greeks 91 game Way ; Gramme VIII. Tlie game of Atep; still played by Italians, and by them called Mora - 103 CHESS. IX. Chess Notation A new system of - - 116 X. Chaturanga. Indian Chess - 119 Alberuni's description of - 139 XI. Chinese Chess - - - 143 XII. Japanese Chess - - 155 XIII. Burmese Chess - - 177 XIV. Siamese Chess - 191 XV. Turkish Chess - 196 XVI. Tamerlane's Chess - - 197 XVII. Game of the Maharajah and the Sepoys - - 217 XVIII. Double Chess - 225 XIX. Chess Problems - - 229 DRAUGHTS. XX. Draughts .... 235 XX [. Polish Draughts - 236 XXI f. Turkish Draughts ..... 037 XXIII. }\'ci-K'i and Go . The Chinese and Japanese game of Enclosing 239 v. -
Representing the Algerian Civil War: Literature, History, and the State
Representing the Algerian Civil War: Literature, History, and the State By Neil Grant Landers A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in French in the GRADUATE DIVISION of the UNIVERSITY OF CALIFORNIA, BERKELEY Committee in charge: Professor Debarati Sanyal, Co-Chair Professor Soraya Tlatli, Co-Chair Professor Karl Britto Professor Stefania Pandolfo Fall 2013 1 Abstract of the Dissertation Representing the Algerian Civil War: Literature, History, and the State by Neil Grant Landers Doctor of Philosophy in French Literature University of California, Berkeley Professor Debarati Sanyal, Co-Chair Professor Soraya Tlatli, Co-Chair Representing the Algerian Civil War: Literature, History, and the State addresses the way the Algerian civil war has been portrayed in 1990s novelistic literature. In the words of one literary critic, "The Algerian war has been, in a sense, one big murder mystery."1 This may be true, but literary accounts portray the "mystery" of the civil war—and propose to solve it—in sharply divergent ways. The primary aim of this study is to examine how three of the most celebrated 1990s novels depict—organize, analyze, interpret, and "solve"—the civil war. I analyze and interpret these novels—by Assia Djebar, Yasmina Khadra, and Boualem Sansal—through a deep contextualization, both in terms of Algerian history and in the novels' contemporary setting. This is particularly important in this case, since the civil war is so contested, and is poorly understood. Using the novels' thematic content as a cue for deeper understanding, I engage through them and with them a number of elements crucial to understanding the civil war: Algeria's troubled nationalist legacy; its stagnant one-party regime; a fear, distrust, and poor understanding of the Islamist movement and the insurgency that erupted in 1992; and the unending, horrifically bloody violence that piled on throughout the 1990s. -
Gradient Play in N-Cluster Games with Zero-Order Information
Gradient Play in n-Cluster Games with Zero-Order Information Tatiana Tatarenko, Jan Zimmermann, Jurgen¨ Adamy Abstract— We study a distributed approach for seeking a models, each agent intends to find a strategy to achieve a Nash equilibrium in n-cluster games with strictly monotone Nash equilibrium in the resulting n-cluster game, which is mappings. Each player within each cluster has access to the a stable state that minimizes the cluster’s cost functions in current value of her own smooth local cost function estimated by a zero-order oracle at some query point. We assume the response to the actions of the agents from other clusters. agents to be able to communicate with their neighbors in Continuous time algorithms for the distributed Nash equi- the same cluster over some undirected graph. The goal of libria seeking problem in multi-cluster games were proposed the agents in the cluster is to minimize their collective cost. in [17]–[19]. The paper [17] solves an unconstrained multi- This cost depends, however, on actions of agents from other cluster game by using gradient-based algorithms, whereas the clusters. Thus, a game between the clusters is to be solved. We present a distributed gradient play algorithm for determining works [18] and [19] propose a gradient-free algorithm, based a Nash equilibrium in this game. The algorithm takes into on zero-order information, for seeking Nash and generalized account the communication settings and zero-order information Nash equilibria respectively. In discrete time domain, the under consideration. We prove almost sure convergence of this work [5] presents a leader-follower based algorithm, which algorithm to a Nash equilibrium given appropriate estimations can solve unconstrained multi-cluster games in linear time. -
Minutes of the Extraordinary General Assembly of the FMJD 2015 Oktober 11,2015, Didim, Turkey Page 1
Minutes of the Extraordinary General assembly of the FMJD 2015 Oktober 11,2015, Didim, Turkey page 1 Present: Members of the Executive Board : Harry Otten President, Jacek Pawlicki Tournament Director also representing Poland and a mandate for Czech Republic, Frits Luteijn Treasurer, Frank Teer General Secretary and President Technical Committee, Johan Demasure Tournament Director Youth also representing Belgium with a mandate from France, Bat-Erdene Chimeddorj , president of the Asian Draughts confederation, also representing Mongolia, with a mandate from Japan, Viktoria Lehtmets, representing the European Draughts Confederation, Ndongo Fall representing the African Draughts Confederation, Vitalia Dumesh , representing the women players Members of committees and sections : Lelio Marcos , contact person of the section 64 Brazilian (international rules), also representing Brazil, with a mandate from Trinidad and Tobago, Ali Kadir Benzer , president of the section Turkish Draughts Anatoli Yacenko , President of the Ethical Committee, also representing Ukraine, Adama Gueye representing the Medical Committee and representing Senegal , Aare Harak, President of the Financial Committee , Milena Szatkowska, member of the financial committee, Xia Lu , member of the financial committee , also representing China Translators: Safiye Bal , translator French-English , Saule Makasheva , translator English-Russian Voting machines : Mehmet Bugra from Eloysis Elektronic, Turkey Representatives of federations : Nofel ashumov, Azerbaidjan, Irina Pashkievitch for Belarus,with a mandate from Lithuania, Jean Marc Ndjofang for Cameroon, Tarmo Tulva for Estonia, Daniele Macali for Italy , Airat Nurgaziyev for Kazakhstan, Guntis Valneris for Latvia , Ben Smeenk for the Netherlands with a mandate from Germany, Oleg Polikarpov for Russia, Ibrahim Ismailov for Turkey, Yunus Amindjonov for Uzbekistan. Assistants: Cindy Li Kaimin , China, also translator English-Chinese, Alisher Artykow, Uzbekistan, Darya Tkachenko, FMJD 1. -
SCIENCE VOLUME 18, No 2, FALL 2007
SCIENCE VOLUME 18, No 2, FALL 2007 FACULTY OF SCIENCE ALUMNI MAGAZINE contourswww.ualberta.ca/science UNIVERSITY Reading CREATES our body’s SPACE chemicals for INSTITUTE better diagnosis Honouring Mama ALUMNUS TURNS Lu’s spirit of GRIEF INTO HOPE giving Fine arts ARCTIC PONDS students liven DRYING UP up lab space through games SCIENCEcontours Science Contours is published twice MESSAGE FROM THE DEAN a year by the faculty of Science to provide current information on its many activities. The magazine is distributed to alumni and friends of the Faculty of An Intersection Between Arts and Science Science. Phase 1 of our new Dean of Science Centennial Centre for Gregory Taylor Interdisciplinary Sci- ence (CCIS) was near- Assistant Dean, External Relations Claudia Wood ing completion when I happened upon a stu- External Relations Team dent art competition on Katherine Captain, Emily Lennstrom, campus. It occurred to Michel Proulx, Traci Toshack, me then that it would be Kevin Websdale wonderful to have stu- Fine arts students Editor dents help us put some Wendy Lung and Ansun Michel Proulx finishing touches on our Yan enjoy their work new space. Graphic Design After a few conversations, two different classes - one in Inte- Studio X Design grative/Exhibit Design and the other in Printmaking - were tasked with coming up with ideas. The results are astounding. Contributing writers To begin with, the students had to wrap their heads around the Bev Betkowski, Kris Connor, Michel purpose and uniqueness of the building. CCIS is one of the few Proulx, Isabela Varela facilities in the world to house interdisciplinary teams under one roof and Phase 1 is no different. -
Game Playing
Game Playing Philipp Koehn 29 September 2015 Philipp Koehn Artificial Intelligence: Game Playing 29 September 2015 Outline 1 ● Games ● Perfect play – minimax decisions – α–β pruning ● Resource limits and approximate evaluation ● Games of chance ● Games of imperfect information Philipp Koehn Artificial Intelligence: Game Playing 29 September 2015 2 games Philipp Koehn Artificial Intelligence: Game Playing 29 September 2015 Games vs. Search Problems 3 ● “Unpredictable” opponent ⇒ solution is a strategy specifying a move for every possible opponent reply ● Time limits ⇒ unlikely to find goal, must approximate ● Plan of attack: – computer considers possible lines of play (Babbage, 1846) – algorithm for perfect play (Zermelo, 1912; Von Neumann, 1944) – finite horizon, approximate evaluation (Zuse, 1945; Wiener, 1948; Shannon, 1950) – first Chess program (Turing, 1951) – machine learning to improve evaluation accuracy (Samuel, 1952–57) – pruning to allow deeper search (McCarthy, 1956) Philipp Koehn Artificial Intelligence: Game Playing 29 September 2015 Types of Games 4 deterministic chance perfect Chess Backgammon information Checkers Monopoly Go Othello imperfect battleships Bridge information Blind Tic Tac Toe Poker Scrabble Philipp Koehn Artificial Intelligence: Game Playing 29 September 2015 Game Tree (2-player, Deterministic, Turns) 5 Philipp Koehn Artificial Intelligence: Game Playing 29 September 2015 Simple Game Tree 6 ● 2 player game ● Each player has one move ● You move first ● Goal: optimize your payoff (utility) Start Your move Opponent -
Tic-Tac-Toe and Machine Learning David Holmstedt Davho304 729G43
Tic-Tac-Toe and machine learning David Holmstedt Davho304 729G43 Table of Contents Introduction ............................................................................................................................... 1 What is tic-tac-toe.................................................................................................................. 1 Tic-tac-toe Strategies ............................................................................................................. 1 Search-Algorithms .................................................................................................................. 1 Machine learning ................................................................................................................... 2 Weights .............................................................................................................................. 2 Training data ...................................................................................................................... 3 Bringing them together ...................................................................................................... 3 Implementation ......................................................................................................................... 4 Overview ................................................................................................................................ 4 UI ....................................................................................................................................... -
Patterns of Long Term Growth in Sub-Saharan Africa Public Disclosure Authorized
WPS4398 POLICY RESEA R CH WO R KING PA P E R 4398 Public Disclosure Authorized Patterns of Long Term Growth in Sub-Saharan Africa Public Disclosure Authorized Jorge Saba Arbache John Page Public Disclosure Authorized The World Bank Public Disclosure Authorized Africa Region Office of the Chief Economist November 2007 POLICY RESEA R CH WO R KING PA P E R 4398 Abstract Using the most recent purchasing power parity data for economic performance over the long run. The authors 44 sub-Saharan African countries, this paper examines also find that the 1990s may mark a turning point in the characteristics of long run growth in Africa between Africa’s growth; income distribution is becoming more 1975 and 2005. The authors find that low and volatile unequal across countries; formation of clubs; initial growth is the outstanding defining characteristic of conditions matter a great deal for income distribution but Africa’s growth experience since 1975, but the authors not for growth; and that geography and natural resources find no evidence that growth volatility is associated with do not seem to matter for growth. This paper—a product of the Office of the Chief Economist for the Africa Region—is part of a larger effort in the department to investigate long term growth in Africa. Policy Research Working Papers are also posted on the Web at http:// econ.worldbank.org. The author may be contacted at [email protected]. The Policy Research Working Paper Series disseminates the findings of work in progress to encourage the exchange of ideas about development issues. -
Rules of Draughts (Checkers)
Rules of Draughts (Checkers) Draughts is a board game of skill played between two players who, following a fixed set of rules, attempt to win the game by either removing all of their opponent’s playing pieces from the draughts board, or by rendering their opponent’s pieces immobile. WCDF Rules of Draughts Preface: The following rules of draughts cannot cover every possible situation that may arise during the course of a game, nor can they regulate for all administrative questions. Where instances arise that are not precisely regulated for by the following rules of draughts, it should be possible for the tournament controller/ referee to reach a correct and fair decision by reflecting on analogous situations, and through the use of absolute objectivity. We believe that the rules should not be over prescriptive so as to deprive a tournament controller / referee of their freedom to make a judgement based on fairness, logic and unforeseen special factors. Section One: Equipment and Rules for Play. THE DRAUGHTBOARD AND ITS ARRANGEMENT 1.1 The draughtboard is composed of 64 squares, alternately light and dark arranged in a square array of 8 rows and 8 columns and bounded by a neutral border. 1.2 The official draughtboard for use in all major events shall be of Green and White (or off white/cream) colours for the dark and light squares. 1.3 The size of squares of the draughts boards should be between 4.5 and 5 centimetres. 1.4 At the commencement of play the draughtboard is placed between the players in such a way that a green square is to be found on the player’s near left side, and a white square to their right side. -
Graph Ramsey Games
TECHNICAL R EPORT INSTITUT FUR¨ INFORMATIONSSYSTEME ABTEILUNG DATENBANKEN UND ARTIFICIAL INTELLIGENCE Graph Ramsey games DBAI-TR-99-34 Wolfgang Slany arXiv:cs/9911004v1 [cs.CC] 10 Nov 1999 DBAI TECHNICAL REPORT Institut f¨ur Informationssysteme NOVEMBER 5, 1999 Abteilung Datenbanken und Artificial Intelligence Technische Universit¨at Wien Favoritenstr. 9 A-1040 Vienna, Austria Tel: +43-1-58801-18403 Fax: +43-1-58801-18492 [email protected] http://www.dbai.tuwien.ac.at/ DBAI TECHNICAL REPORT DBAI-TR-99-34, NOVEMBER 5, 1999 Graph Ramsey games Wolfgang Slany1 Abstract. We consider combinatorial avoidance and achievement games based on graph Ramsey theory: The players take turns in coloring still uncolored edges of a graph G, each player being assigned a distinct color, choosing one edge per move. In avoidance games, completing a monochromatic subgraph isomorphic to another graph A leads to immedi- ate defeat or is forbidden and the first player that cannot move loses. In the avoidance+ variants, both players are free to choose more than one edge per move. In achievement games, the first player that completes a monochromatic subgraph isomorphic to A wins. Erd˝os & Selfridge [16] were the first to identify some tractable subcases of these games, followed by a large number of further studies. We complete these investigations by settling the complexity of all unrestricted cases: We prove that general graph Ramsey avoidance, avoidance+, and achievement games and several variants thereof are PSPACE-complete. We ultra-strongly solve some nontrivial instances of graph Ramsey avoidance games that are based on symmetric binary Ramsey numbers and provide strong evidence that all other cases based on symmetric binary Ramsey numbers are effectively intractable. -
Building a Champion Level Computer Poker Player
University of Alberta Library Release Form Name of Author: Michael Bradley Johanson Title of Thesis: Robust Strategies and Counter-Strategies: Building a Champion Level Computer Poker Player Degree: Master of Science Year this Degree Granted: 2007 Permission is hereby granted to the University of Alberta Library to reproduce single copies of this thesis and to lend or sell such copies for private, scholarly or scientific research purposes only. The author reserves all other publication and other rights in association with the copyright in the thesis, and except as herein before provided, neither the thesis nor any substantial portion thereof may be printed or otherwise reproduced in any material form whatever without the author’s prior written permission. Michael Bradley Johanson Date: Too much chaos, nothing gets finished. Too much order, nothing gets started. — Hexar’s Corollary University of Alberta ROBUST STRATEGIES AND COUNTER-STRATEGIES: BUILDING A CHAMPION LEVEL COMPUTER POKER PLAYER by Michael Bradley Johanson A thesis submitted to the Faculty of Graduate Studies and Research in partial fulfillment of the requirements for the degree of Master of Science. Department of Computing Science Edmonton, Alberta Fall 2007 University of Alberta Faculty of Graduate Studies and Research The undersigned certify that they have read, and recommend to the Faculty of Graduate Studies and Research for acceptance, a thesis entitled Robust Strategies and Counter-Strategies: Building a Champion Level Computer Poker Player submitted by Michael Bradley Johanson in partial fulfillment of the requirements for the degree of Master of Science. Michael Bowling Supervisor Duane Szafron Michael Carbonaro External Examiner Date: To my family: my parents Brad and Sue Johanson, and my brother, Jeff Johanson.