DOCSLIB.ORG

The Theory of Games

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Theory of Games The Theory of Games Andrea Schalk [email protected] School of Computer Science University of Manchester Copyright c A. Schalk 2013 i Preface A note to 2020{2019 students of COMP34120 from Jon Shapiro What follows is the 2013 version of a set of lecture notes Written by An- drea Schalk. This was produced by Andrea for the first semester (or more specifically weeks 2 { 5) of an earlier version of this course. It is a shortened and slightly refocused version of a beautiful set of notes for a full-semester course on the theory of games which Dr. Schalk used to teach. The course COMP34120 was devised by Andrea, Xiao-Jun, and me, and these notes were written by Andrea to support her part of the course. Now Andrea has moved on to other teaching, and I have taken over her part of the course. Andrea has very generously agreed to allow me to continue to use her lecture notes, and as I think they are extremely good, and very appropriate for this course, I intend to use them as a textbook. As students you need to note a few things. First, Andrea writes this as if she is teaching the course, which she no longer is. So, on page 2 where she writes \I expect", is not quite right. We are covering the material more quickly and in less depth than she did in the previous course, but are covering more material. I will try to make clear through Blackboard which parts of the notes are relevant for each week. I will not necessarily follow the B, S, A designation of exercises and their relations to exam question, but the exam will not be harder than that. Basically, if you skip to the \What is a game" section in the middle of page 2, you will start where I want you to start. You may also skip page 4, because she is not going to update these notes. From page 5 on is what we will use. There are bookmarks which relate to lectures in earlier version of the course. Ignore them; they no longer pertain. It is also worth noting these notes were produced in 2013. The field, and Andrea's knowledge of the field has developed. These might not be exactly what she would write today. Jon Shapiro September 11, in the year of Covid, 2020 ii This page intentionally left blank. 1 We will not be going through every detail of the notes and it is every student’s responsi- bility to ensure that they have read and understood the relevant material. You will not get much out of these sessions if you haven’t done the reading. There are a few exercises in the notes to help you apply the ideas to concrete examples. Most of these should be straightforward after a thorough study of the notes. Solutions to the exercises are included. Exam questions might take the form of simpler exercises, or might ask you to outline how one might go about solving a more complicated one. The exercises have a rating. This can be: B Basic: I expect you to be able to do this in the exam. S Simple: I expect you to describe how to solve an exercise like this in the exam. A Advanced: These exercises are there for students who want to gain a more thorough understanding, and who would like something to work through. There are also items labelled ‘question’ which encourage you to pause before reading on and to think about the issue raised there. Many of these questions are answered in the following paragraph or two. The material is relevant for the first project in which small groups of students are required to write a program playing a game called kalah. The resulting programs will be run against each other, and some of the project mark will be assigned based on performance in this direct comparison. There will also be some questions in the exam covering the material in these notes. My main responsibility within this course unit is concerned with the delivery of the mate- rial described in these notes. I will also provide some help for the first semester group project in the sessions in Week 7-11. If you have questions about other aspects you should ask the appropriate member of the lecturing team. What is a game? A technical definition of a game appears in the next chapter, here we just want to give an intuition. Every time people (or, more generally, agents) interact with each other and jointly influence an outcome we can think of it as a game. There are lots of examples and everybody will have encountered at least some of these: Somebody has an old mp3-player that he know longer wants. He’s offering it to his • friend and will give it to the person who offers him the most in return. How should his friends decide how much to bid? What rules should he set so that he gets the largest amount? In a shared student flat the kitchen and the bathroom need to be cleaned regularly to • stay in a decent condition—else the landlord is going to make trouble (and most people don’t enjoy living in a filthy place). Does game theory tell us something about what the likely behaviour of the inhabitants is going to be, and does it help explaining it? On a network there is a limited capacity for transporting data. How should the indi- • vidual machines on it be configured to ensure that – the capacity is shared fairly and – the existing capacity is fully exploited whenever there is sufficient demand? Bear in mind that a machine sending information will have no information about what the other machines on the network are doing. We can think of the buying and the selling of shares on the stock market as a game (lots • of entities interact, and the outcome is defined by money and shares changing hands). If we could predict how the market is going to behave in the future we could make a lot of money. 2 There are, of course, also the better known (and expected) examples of playing a board or card game. What all these ‘games’ have in common is that they can be defined more formally in such a way that they have the following properties: A number of agents interact with each other. These are known as the players. • At the end of their interactions there is an outcome that can be described numerically— • each player receives a pay-off which may be negative. There are clearly defined rules as to what decisions each agent can make at which point • in time and once all such decisions have been made the outcome is uniquely determined. These are fairly broad requirements, which are met by many situations in the real world. That is the reason games have been so successful at modelling a great variety of issues, and they are used in areas such as computer science, sociology, economics, biology, and mathematics. In some of these subjects it is quite difficult to come up with a mathematical model that allows a worthwhile analysis of some situation, and in many cases the theory of games supplies by far the most productive one. Rather than trying to describe something through a set of equations all that is required here is the codification of the rules, and putting a number to the potential outcomes that somehow measures its ‘benefit’ (or detriment) to the participants. Game theory allows for an analysis of the resulting model. In some cases, where many similar transactions occur, it can be quite easy to describe the rules for the interaction of two individuals, and the complexity arises from the fact that many such interactions occur over a period of time. We see in the chapters on modelling that this can give rise to systems which are very expressive, but which are still only partly understood. Games have also been successfully studied as models of conflict, for example in biology (animals or plants competing for resources or mating partners) as well as in sociology (people competing for resources, or those with conflicting aims). In particular in the early days of the theory of games a lot of work was funded by the military. Two basic assumptions are being made here which are not completely unproblematic: It is assumed that the numeric value associated with a particular outcome (that is, the • pay-off for each player) adequately reflects the worth of that outcome to all the players. Each player is concerned with maximizing his own outcome (this is sometimes known • as ‘rational behaviour’) without regard of the outcome for the other players. We do not spend much time in questioning these assumptions, but you should be aware of them. Game theory cannot say anything about situations where these don’t apply. In the real world people do not always behave rationally. To give a practical example, assume you are given a coin and, when observing it being thrown, you notice that it shows heads about 75% of the time, and tails the remaining 25%. When asked to bet on such a coin, a player’s chances are maximized by betting on heads every single time. It turns out, however, that people typically bet on heads 75% of the time only! One has to make some kind of assumption on how people will behave in a given situation in order to model it. In the absence of the above rationality assumption it might be possible instead to describe ‘typical’ behaviour and use that (this is often done in economy) but we do not pursue that idea here.
Load more

Recommended publications
  • Issue 16, June 2019 -...CHESSPROBLEMS.CA
    ...CHESSPROBLEMS.CA Contents 1 Originals 746 . ISSUE 16 (JUNE 2019) 2019 Informal Tourney....... 746 Hors Concours............ 753 2 Articles 755 Andreas Thoma: Five Pendulum Retros with Proca Anticirce.. 755 Jeff Coakley & Andrey Frolkin: Multicoded Rebuses...... 757 Arno T¨ungler:Record Breakers VIII 766 Arno T¨ungler:Pin As Pin Can... 768 Arno T¨ungler: Circe Series Tasks & ChessProblems.ca TT9 ... 770 3 ChessProblems.ca TT10 785 4 Recently Honoured Canadian Compositions 786 5 My Favourite Series-Mover 800 6 Blast from the Past III: Checkmate 1902 805 7 Last Page 808 More Chess in the Sky....... 808 Editor: Cornel Pacurar Collaborators: Elke Rehder, . Adrian Storisteanu, Arno T¨ungler Originals: [email protected] Articles: [email protected] Chess drawing by Elke Rehder, 2017 Correspondence: [email protected] [ c Elke Rehder, http://www.elke-rehder.de. Reproduced with permission.] ISSN 2292-8324 ..... ChessProblems.ca Bulletin IIssue 16I ORIGINALS 2019 Informal Tourney T418 T421 Branko Koludrovi´c T419 T420 Udo Degener ChessProblems.ca's annual Informal Tourney Arno T¨ungler Paul R˘aican Paul R˘aican Mirko Degenkolbe is open for series-movers of any type and with ¥ any fairy conditions and pieces. Hors concours compositions (any genre) are also welcome! ! Send to: [email protected]. " # # ¡ 2019 Judge: Dinu Ioan Nicula (ROU) ¥ # 2019 Tourney Participants: ¥!¢¡¥£ 1. Alberto Armeni (ITA) 2. Rom´eoBedoni (FRA) C+ (2+2)ser-s%36 C+ (2+11)ser-!F97 C+ (8+2)ser-hsF73 C+ (12+8)ser-h#47 3. Udo Degener (DEU) Circe Circe Circe 4. Mirko Degenkolbe (DEU) White Minimummer Leffie 5. Chris J. Feather (GBR) 6.
    [Show full text]
  • Mémoire De Master
    République Algérienne Démocratique et Populaire Ministère de l'Enseignement Supérieur et de la Recherche Scientifique Université Mouloud Mammeri de Tizi-Ouzou Faculté de : Génie électrique et d'informatique Département : Informatique Mémoire de fin d’études En vue de l’obtention du diplôme de Master en Informatique Spécialité : Systèmes Informatiques Réalisé et présenté par : MEHALLI Nassim Sujet : Mise en œuvre de l’apprentissage automatique pour l’évaluation des positions échiquéennes Proposé et dirigé par : SADI Samy Soutenu le 11 juillet 2019 devant le jury composé de: Mr. RAMDANI Mohammed Président du Jury Mlle. YASLI Yasmine Membre du Jury Mr. SADI Samy Directeur de mémoire Dédicaces Je dédie ce travail à mes chers parents qui ne cessent de me donner l’amour nécessaire pour que je puisse arriver à ce que je suis aujourd’hui. Que dieux vous protège et que la réussite soit toujours à ma portée pour que je puisse vous combler de bonheur et d’argent le jour où je serai milliardaire. Je dédie aussi ce modèste travail À mes chers oncles Omar et Mahdi À mon frère et ma sœur À Mima ma meilleure À Sousou et mon meilleur ami Mamed À Racim et Milou À Ine Boula3rass À Smail Remerciements Je remercie Allah de m’avoir donné le courage et la force afin d’accomplir ce modeste projet. Je remercie mon encadreur, monsieur Sadi, pour tout ce qu’il m’a appris dans le monde de l’intelligence artificielle ainsi que toutes ses remarques pertinentes. Je remercie l'ensemble des membres du jury, qui m'ont fait l'honneur de bien vouloir étudier avec attention mon travail.
    [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]
  • A Chess Engine
    A Chess Engine Paul Dailly Dominik Gotojuch Neil Henning Keir Lawson Alec Macdonald Tamerlan Tajaddinov University of Glasgow Department of Computing Science Sir Alwyn Williams Building Lilybank Gardens Glasgow G12 8QQ March 18, 2008 Abstract Though many computer chess engines are available, the number of engines using object orientated approaches to the problem is minimal. This report documents an implementation of an object oriented chess engine. Traditionally, in order to gain the advantage of speed, the C language is used for implementation, however, being an older language, it lacks many modern language features. The chess engine documented within this report uses the modern Java language, providing features such as reflection and generics that are used extensively, allowing for complex but understandable code. Also of interest are the various depth first search algorithms used to produce a fast game, and the numerous functions for evaluating different characteristics of the board. These two fundamental components, the evaluator and the analyser, combine to produce a fast and relatively skillful chess engine. We discuss both the design and implementation of the engine, along with details of other approaches that could be taken, and in what manner the engine could be expanded. We conclude by examining the engine empirically, and from this evaluation, reflecting on the advantages and disadvantages of our chosen approach. Education Use Consent We hereby give our permission for this project to be shown to other University of Glasgow students and to be distributed in an electronic format. Please note that you are under no obligation to sign this declaration, but doing so would help future students.
    [Show full text]
  • Get in Touch with Jaap Van Den Herik
    28 ICCA Journal March 1992 NEWS, INFORMATION, TOURNAMENTS AND REPORTS A DATABASE AS A SECOND D.M. Breuker L.v. Allis I.S. Herschberg H.J. van den Herik University of Limburg Delft Unversity of Technology Dept. of Computer Science Dept. of Technical Mathematics Maastricht, The Netherlands and Informatics Delft, The Netherlands ABSTRACT Chess endgame databases have provided computer-chess researchers with perfect knowledge of many endgames. Grandmaster play, however, has been largely unaffected by their existence. In the 1992 Linares tournament, Timman and Speelman adjourned a posi- tion which could lead to the KBBKN endgame. With the aid of publications on computer analysis of this endgame, Timman successfully prepared for the human-to-human confronta- tion and defeated Speelman. This contribution describes the background of the KBBKN endgame, the sequence of events which led to Timman's victory, and presents analyses of the grandmasters' performance. 1. BACKGROUND More than a century ago, Kling and Horwitz (1851) published the first thorough study of the KBBKN endgame. Their analysis showed that in the position of Diagram 1, Black can hold out indefinitely against White's attacks. They concluded that King and two Bishops cannot win if the weaker side can obtain the posi- tion of Diagram 1. The essential feature of this position is the King and the Knight's making up a fortress near a comer of the board, it being crucial that the Knight is on b7; this essence is maintained upon reflection in one or both of the board's medial lines. Kling and Horwitz (1851) asserted that Diagram 1 and its reflections pro- vided an exception, and that, Black failing to achieve Diagram I, White was bound to win.
    [Show full text]
  • The Fredkin Challenge Match
    AI Magazine Volume 2 Number 2 (1981) (© AAAI) TheFredkin AI!+halhge..'*A.... M&h by Hans Berliner Computer Science Department Carnegie-Mellon University Pittsburgh, Pennsylvania 15213 Chairman, Fredkin Prize Committee On August 18 and 19, 1980, at Stanford University during at Stanford University, with the actual game on in a closed the AAAI conference, the first of a projected pair of annual room containing only the player, computer terminal operators chess competitions pitting the world’s best computer pro- (Larry Atkin and David Cahlander of Control Data Corpora- grams against rated human players of approximately the same tion) and the referee. Upstairs was a large demonstration strength was held. These matches are part of the Fredkin prize room where two boards, one for the actual position and one competition, wherein a sum of $100,000, established by the for analysis, were used to keep the audience abreast of what Fredkin Foundation of Cambridge, Mass , is to be awarded to was happening and could be expected to happen. The moves the creators of a program that can defeat the World Chess were communicated through a telecommunications setup Champion in official competition. linking the two rooms. The program in this match was CHESS 4.9 of Northwes- In the first game, CHESS 4.9 played the White side of a tern University, authored by David Slate and Larry Atkin. At Sicilian Defense very badly, as it had done on several the same time, it was the best computer chess program in the occasions previously Later, it refused to force a draw in an world (recently surpassed by BELLE), and was the winner of inferior position.
    [Show full text]
  • PICDEM-3 User's Guide
    PICDEM-3 User’s Guide Information contained in this publication regarding device applications and the like is intended through suggestion only and may be superseded by updates. No representation or warranty is given and no liability is assumed by Microchip Technology Incorporated with respect to the accuracy or use of such information, or infringement of patents or other intellectual property rights arising from such use or otherwise. Use of Microchip’s products as critical components in life support systems is not authorized except with express written approval by Microchip. No licenses are conveyed, implicitly or otherwise, under any intellectual property rights. The Microchip logo, name, PIC, PICMASTER, PICSTART, and PRO MATE are registered trademarks of Microchip Technology Incorporated in the U.S.A. and other countries. MPLAB is a trademark of Microchip in the U.S.A. Microchip Technology Incorporated 1996. Intel is a registered trademark of Intel Corporation. IBM PC/AT is a registered trademark of International Business Machines Corporation. MS Windows, Microsoft Windows, and Windows are trademarks of Microsoft Corporation. All rights reserved. All other trademarks mentioned herein are the property of their respective companies. 1996 Microchip Technology Inc. DS51079A PICDEM-3 USER’S GUIDE DS51079A 1996 Microchip Technology Inc. PICDEM-3 USER’S GUIDE Table of Contents Preface Welcome . .1 Documentation Layout . .1 Chapter 1. About PICDEM-3 Introduction . .3 Highlights . .3 Processor Sockets . .3 Liquid Crystal Display . .3 Power Supply . .3 RS-232 Serial Port . .4 Pushbutton Switches . .4 Oscillator Options . .4 Analog Inputs . .5 Keypad Header . .5 External LCD Panel Connector . .5 LCD Software Demultiplexer .
    [Show full text]
  • Chess As Played by Artificial Intelligence
    Chess as Played by Artificial Intelligence Filemon Jankuloski, Adrijan Božinovski1 University American College of Skopje, Skopje, Macedonia [email protected] [email protected] Abstract. In this paper, we explore the evolution of how chess machinery plays chess. The purpose of the paper is to discuss the several different algorithms and methods which are implemented into chess machinery systems to either make chess playing more efficient or increase the playing strength of said chess machinery. Not only do we look at methods and algorithms implemented into chess machinery, but we also take a look at the many accomplishments achieved by these machines over a 70 year period. We will analyze chess machines from their conception up until their absolute domination of the competitive chess scene. This includes chess machines which utilize anything from brute force approaches to deep learning and neural networks. Finally, the paper is concluded by discussing the future of chess machinery and their involvement in both the casual and competitive chess scene. Keywords: Chess · Algorithm · Search · Artificial Intelligence 1 Introduction Artificial intelligence has become increasingly prevalent in our current society. We can find artificial intelligence being used in many aspects of our daily lives, such as through the use of Smartphones and autonomous driving vehicles such as the Tesla. There is no clear and concise definition for Artificial Intelligence, since it is a subject which still has massive space for improvement and has only recently been making most of its significant advancements. Leading textbooks on AI, however, define it as the study of “intelligent agents”, which can be represented by any device that perceives its environment and takes actions that maximizes its chances of achieving its goals [1].
    [Show full text]
  • An Historical Perspective Through the Game of Chess
    On the Impact of Information Technologies on Society: an Historical Perspective through the Game of Chess Fr´ed´eric Prost LIG, Universit´ede Grenoble B. P. 53, F-38041 Grenoble, France [email protected] Abstract The game of chess as always been viewed as an iconic representation of intellectual prowess. Since the very beginning of computer science, the challenge of being able to program a computer capable of playing chess and beating humans has been alive and used both as a mark to measure hardware/software progresses and as an ongoing programming challenge leading to numerous discoveries. In the early days of computer science it was a topic for specialists. But as computers were democratized, and the strength of chess engines began to increase, chess players started to appropriate to themselves these new tools. We show how these interac- tions between the world of chess and information technologies have been herald of broader social impacts of information technologies. The game of chess, and more broadly the world of chess (chess players, literature, computer softwares and websites dedicated to chess, etc.), turns out to be a surprisingly and particularly sharp indicator of the changes induced in our everyday life by the information technologies. Moreover, in the same way that chess is a modelization of war that captures the raw features of strategic thinking, chess world can be seen as small society making the study of the information technologies impact easier to analyze and to arXiv:1203.3434v1 [cs.OH] 15 Mar 2012 grasp. Chess and computer science Alan Turing was born when the Turk automaton was finishing its more than a century long career of illusion1.
    [Show full text]
  • Sustavi Otvorenog Koda Za Igranje Šaha
    Sustavi otvorenog koda za igranje šaha Kovač, Hrvoje Master's thesis / Diplomski rad 2018 Degree Grantor / Ustanova koja je dodijelila akademski / stručni stupanj: University of Zagreb, Faculty of Science / Sveučilište u Zagrebu, Prirodoslovno-matematički fakultet Permanent link / Trajna poveznica: https://urn.nsk.hr/urn:nbn:hr:217:000991 Rights / Prava: In copyright Download date / Datum preuzimanja: 2021-09-25 Repository / Repozitorij: Repository of Faculty of Science - University of Zagreb SVEUCILIˇ STEˇ U ZAGREBU PRIRODOSLOVNO–MATEMATICKIˇ FAKULTET MATEMATICKIˇ ODSJEK Hrvoje Kovacˇ SUSTAVI OTVORENOG KODA ZA IGRANJE SAHAˇ Diplomski rad Voditelj rada: prof.dr.sc. Luka Grubisiˇ c´ Zagreb, srpanj, 2018. Ovaj diplomski rad obranjen je dana pred ispitnim povjerenstvom u sastavu: 1. , predsjednik 2. , clanˇ 3. , clanˇ Povjerenstvo je rad ocijenilo ocjenom . Potpisi clanovaˇ povjerenstva: 1. 2. 3. Poˇstovani profesore Grubiˇsi´c,puno Vam hvala na pomo´cii pruˇzenojpotpori pri izradi ovog rada. Takoder, ˇzeliobih se zahvaliti svim prijateljima i kolegama, a posebno MNI-ovcima (ukljuˇcuju´cii profesore), uz koje su dvije godine diplomskog studija proletjele. Na kraju, najve´cehvala mojoj djevojci, roditeljima, bratu i ostatku obitelji na pruˇzenoj podrˇscii strpljenju. Sadrzajˇ Sadrzajˇ iv Uvod 1 1 Opcenito´ o racunalnomˇ sahuˇ 2 2 Osnovne komponente sahovskogˇ racunalaˇ 9 2.1 Reprezentacija ploceˇ i figura . 9 2.2 Generiranje poteza . 11 2.3 Evaluacijska funkcija . 12 2.4 Pretrazivanjeˇ . 14 2.5 Vlastiti program . 19 3 Automatizacija u modernim sustavima za igranje sahaˇ 24 3.1 Automatizirano podesavanjeˇ parametara evaluacijske funkcije . 24 3.2 Strojno ucenjeˇ i njegove primjene u racunalnomˇ sahuˇ . 27 Bibliografija 35 iv Uvod Konstrukcija programa koji ce´ igrati sahˇ na racionalan nacinˇ bila je izazov za pionire umjetne inteligencije pedesetih godina proslogˇ stoljeca.´ Napretkom tehnologije racunalniˇ programi za igranje sahaˇ postajali su sve jaciˇ i krajem proslogˇ stoljeca´ sahovskoˇ racunaloˇ Deep Blue pobijedilo je u mecuˇ svjetskog prvaka Garija Kasparova.
    [Show full text]
  • Exploring Modern Chess Engine Architectures
    Vrije Universiteit Amsterdam Bachelor Thesis Exploring modern chess engine architectures Author: Pieter Bijl (2647306) Author: Anh Phi Tiet (2638026) 1st supervisor: Prof. Dr. W.J. Fokkink 2nd reader: Prof. Dr. ir. H.E. Bal A thesis submitted in fulfillment of the requirements for the VU Bachelor of Science degree in Computer Science July 5, 2021 CONTENTS I Introduction 3 II Basics of chess engine architecture 3 II-A Board representation . .3 II-B Move generation . .6 II-C Search . .9 II-D Evaluation . 12 III Methodology 17 IV Results 18 IV-A Results . 18 IV-B Result analysis . 19 V Conclusion 20 VI Discussion 20 References 23 Appendix 23 2 Abstract—The game of chess is over 1000 years old and is move generator is often the limiting factor, and in a regular still not optimally played in the 21st century. This thesis aims to alpha beta style search. The first research question here is explore the technical history of chess computing over the last 40 as follows: Which approach to board representation is the years. Various techniques that have been employed throughout that time are implemented and tested to determine their perfor- fastest for move generation, which suits a full general purpose mance differences. Similarly, classical evaluation functions that chess engine, and in which subroutines of the engine is the attempt to score a position based on handcrafted, human-like choice of board representation most critical? We hypothesize chess features are broken down and their parameters tuned. that magic and PEXT bitboards will beat the others in both In conclusion, implementations of both array centric board scenarios, where PEXT bitboards perform slightly better.
    [Show full text]
  • 091028 Belle Grid 구축.Hwp
    gLite 3.1기반 Belle Grid 구축 보고서 머리말 본 책자는2008 년 노벨물리학상을 배출한 KEK 의 Belle 실험을 위한 그리드 인프라를 구축하는 과정을 기술하고 있습니다. Belle 실험의 그리드 인프라는 주로MC(Mote Carlo) Production 을 수행하고 있으며 최근 후속 실험인 Belle II 에서는 기하급수적으로 늘어나는 데이터량과 프로세스량을 처리하기 위해 적극 적으로 그리드 도입을 서두르고 있습니다. 이 책자를 통해 향후 국내 연구자 들을 위한Belle 및 Belle II 실험 지원에 도움이 될 수 있기를 기원합니다 . 이 책자를 만들어내기까지 도움을 주신 모든 분들께 감사드립니다. 2009년 11 월 15 일 작 성 자: 김 법 균 (KISTI) 유 진 승 (KISTI) 윤 희 준 (KISTI) 권 석 면 (KISTI) Christophe Bonnaud (KISTI) 박 형 우 (KISTI) 장 행 진 (KISTI) gLite 3.1기반 Belle Grid 구축 보고서 제목 차례 Glossary ······························································································································· 1 Ⅰ. 개요 ······························································································································· 4 1. KEK 소개 ······················································································································· 4 Ⅱ. Belle Grid 구축 ··········································································································· 9 1. Belle Grid 구축 개요 ··································································································· 9 2. CE (with lcg-CE) ·········································································································· 9 (1) VOMS인증서 설치 (Installation of VOMS Certificate) ································· 10 (2) Belle VO 가입 ······································································································ 10 (3) VO Parameter Setting ··························································································
    [Show full text]