DOCSLIB.ORG

Data-Driven Soundtracks for Chess

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Data-Driven Soundtracks for Chess Data-Driven Soundtracks for Chess Stefan Höller MASTERARBEIT eingereicht am Fachhochschul-Masterstudiengang Interactive Media in Hagenberg im November 2019 © Copyright 2019 Stefan Höller This work is published under the conditions of the Creative Commons License Attribution- NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)—see https:// creativecommons.org/licenses/by-nc-nd/4.0/. ii Declaration I hereby declare and confirm that this thesis is entirely the result of my own original work. Where other sources of information have been used, they have been indicated as such and properly acknowledged. I further declare that this or similar work has not been submitted for credit elsewhere. Hagenberg, November 26, 2019 Stefan Höller iii Contents Declaration iii Abstract viii Kurzfassung ix 1 Introduction 1 1.1 Motivation . .1 1.2 Problem Statement . .1 1.3 Document Structure . .2 2 Chess 3 2.1 Principles and Metrics . .3 2.1.1 Move . .3 2.1.2 Attacks . .3 2.1.3 Castling . .5 2.1.4 Blunder . .5 2.1.5 Material . .5 2.1.6 Mobility . .6 2.1.7 Initiative . .6 2.1.8 Pawn Structure . .7 2.1.9 Passed Pawn . .7 2.1.10 Development . .7 2.1.11 Imbalances . .7 2.1.12 Phases of Chess . .7 2.2 Chess Engines Overview . .8 2.2.1 First Mechanical Chess Players . .8 2.2.2 Shannon’s Chess Engine Definition . 10 2.2.3 Chess Engines Pursuit to Gain Strength . 11 2.3 Chess Engine Principles . 12 2.3.1 Board Representation . 12 2.3.2 Static Evaluation Function . 13 2.3.3 Look-Ahead Procedure . 13 2.3.4 Opening Book . 14 2.3.5 End Game . 15 2.4 Stockfish . 15 iv Contents v 2.5 Universal Chess Interface . 15 2.6 Chess Notations . 16 2.7 Centipawn . 16 2.8 Score . 17 2.9 Elo Rating . 17 2.10 Summary . 17 3 Adaptive Soundtracks 19 3.1 Audio Programming Languages . 19 3.2 FMOD . 21 3.3 Choosing the Appropriate Audio Program . 22 3.4 Controlling Adaptive Soundtracks . 22 3.5 Audio Synthesis for Chess . 24 3.5.1 Reunion . 24 3.5.2 Reunion2012 . 25 3.5.3 Music for 32 Chess Pieces . 26 3.6 Summary . 26 4 Data-Driven Soundtracks for Chess 28 4.1 Requirements . 28 4.2 Limitations . 30 4.3 First Soundtrack Design . 30 4.3.1 Samples . 31 4.3.2 Audio Tracks . 31 4.3.3 Leading Player . 31 4.3.4 Intensity . 32 4.3.5 Possible Moves . 32 4.3.6 Is Check . 32 4.3.7 Move Category . 32 4.3.8 Attackers Count . 33 4.4 Second Soundtrack Design . 33 4.4.1 Samples . 33 4.4.2 Base Layers . 34 4.4.3 Fluctuation . 34 4.4.4 Unopposed Threats . 34 4.4.5 Mistake . 35 4.4.6 Is Capture . 35 4.4.7 Possible Moves . 35 4.4.8 Attack/Defense Relation . 35 4.5 Summary . 35 5 Implementation 37 5.1 Architecture . 37 5.1.1 Database . 40 5.2 Details on the Chess Analysis Tool . 40 5.2.1 Open a Chess Game . 40 5.2.2 Connect to Stockfish . 40 Contents vi 5.2.3 Main Program for Chess Analysis . 41 5.2.4 Computing Score and Best Move . 42 5.2.5 Categorize Difference between Best and Actual Move . 43 5.2.6 Analyzing Captures . 44 5.2.7 Detect Attacks . 45 5.2.8 Detect Guards . 45 5.2.9 Detect Unopposed Threats . 46 5.2.10 Determine the Number of Possible Moves . 46 5.2.11 Determine the Number of Threats . 47 5.2.12 Parameter Definitions . 47 5.3 Details on the FMOD Studio Event . 51 5.4 Details on the Chess Music Tool . 52 5.4.1 Loading a Game into Chess Music Tool . 52 5.4.2 Load FMOD Bank . 53 5.4.3 Initialize FMOD Parameters . 53 5.4.4 Fluctuating Score . 54 5.5 Summary . 54 6 Evaluation 56 6.1 Heuristic Evaluation . 56 6.1.1 Method . 56 6.1.2 Adjusted Approach . 58 6.1.3 Result . 59 6.1.4 General Feedback . 62 6.2 Chess Metric Ranking . 62 6.3 Chess Metric Evaluation . 63 6.3.1 Score and Score Change . 64 6.3.2 Threats . 65 6.3.3 Mistakes . 66 6.3.4 Captures . 68 6.3.5 Legal Moves . 70 6.4 Real-Time Evaluation . 71 6.5 Summary . 72 7 Conclusion 73 7.1 Evaluation Results . 73 7.2 Future Prospects . 75 7.3 Conclusion . 76 A Technical Details 77 A.1 Project Directory . 77 B CD-ROM/DVD Contents 79 B.1 PDF-Files . 79 B.2 Project . 79 B.3 Miscellaneous . 80 Contents vii References 81 Literature . 81 Audio-visual media . ..
Load more

Recommended publications
  • AI from a Game Player Perspective Eleonora Giunchiglia Why?
    AI from a game player perspective Eleonora Giunchiglia Why? David Churchill, professor at Memorial University of Newfoundland: ``From a scientific point of view, the properties of StarCraft are very much like the properties of real life. [. .] We’re making a test bed for technologies we can use in the real world.’’ This concept can be extended to every game and justifies the research of AI in games. Connections with MAS A multiagent system is one composed of multiple interacting software components known as agents, which are typically capable of cooperating to solve problems that are beyond the abilities of any individual member. This represents by far a more complex setting than the traditional 1vs1 games à only in recent years they were able to study games with multiple agents. In this project we traced the path that led from AI applied to 1vs1 games to many vs. many games. The very first attempts The very first attempts were done even before the concept of Artificial intelligence was born: 1890: Leonardo Torres y Quevedo developed an electro-mechanical device, El Ajedrecista, to checkmate a human opponent’s king using only its own king and rook. 1948: Alan Turing wrote the algorithm TurboChamp. He never managed to run it on a real computer. The very first attempts 1950: Claude Shannon proposes the Minimax algorithm. Shannon proposed two different ways of deciding the next move: 1. doing brute-force tree search on the complete tree, and take the optimal move, or 2. looking at a small subset of next moves at each layer during tree search, and take the “likely optimal” move.
    [Show full text]
  • Labeling Parts of Speech Using Untrained Annotators on Mechanical Turk THESIS Presented in Partial Fulfillment of the Requiremen
    Labeling Parts of Speech Using Untrained Annotators on Mechanical Turk THESIS Presented in Partial Fulfillment of the Requirements for the Degree Master of Science in the Graduate School of The Ohio State University By Jacob Emil Mainzer Graduate Program in Computer Science and Engineering The Ohio State University 2011 Master's Examination Committee: Professor Eric Fosler-Lussier, Advisor Professor Mikhail Belkin Copyright by Jacob Emil Mainzer 2011 Abstract Supervised learning algorithms often require large amounts of labeled data. Creating this data can be time consuming and expensive. Recent work has used untrained annotators on Mechanical Turk to quickly and cheaply create data for NLP tasks, such as word sense disambiguation, word similarity, machine translation, and PP attachment. In this experiment, we test whether untrained annotators can accurately perform the task of POS tagging. We design a Java Applet, called the Interactive Tagging Guide (ITG) to assist untrained annotators in accurately and quickly POS tagging words using the Penn Treebank tagset. We test this Applet on a small corpus using Mechanical Turk, an online marketplace where users earn small payments for the completion of short tasks. Our results demonstrate that, given the proper assistance, untrained annotators are able to tag parts of speech with approximately 90% accuracy. Furthermore, we analyze the performance of expert annotators using the ITG and discover nearly identical levels of performance as compared to the untrained annotators. ii Vita 2009................................................................B.S. Physics, University of Rochester September 2009 – August 2010 .....................Distinguished University Fellowship, The Ohio State University September 2010 – June 2011 .........................Graduate Teaching Assistant, The Ohio State University Fields of Study Major Field: Computer Science and Engineering iii Table of Contents Abstract ..............................................................................................................................
    [Show full text]
  • Return of the Crowds: Mechanical Turk and Neoliberal States of Exception 79 Ayhan Aytes Vi Contents
    DIGITAL LABOR The Internet as Playground and Factory Edited by Trebor Scholz First published 2013 by Routledge 711 Third Avenue, New York, NY 10017 Simultaneously published in the UK by Routledge 2 Park Square, Milton Park, Abingdon, Oxon OX14 4RN Routledge is an imprint of the Taylor & Francis Group, an informa business © 2013 Taylor & Francis The right of the editor to be identifi ed as the author of the editorial material, and of the authors for their individual chapters, has been asserted in accordance with sections 77 and 78 of the Copyright, Designs and Patents Act 1988. All rights reserved. No part of this book may be reprinted or reproduced or utilised in any form or by any electronic, mechanical, or other means, now known or hereafter invented, including photocopying and recording, or in any information storage or retrieval system, without permission in writing from the publishers. Trademark notice: Product or corporate names may be trademarks or registered trademarks, and are used only for identifi cation and explanation without intent to infringe. Library of Congress Cataloging-in-Publication Data Digital labor : the Internet as playground and factory / edited by Trebor Scholz. p. cm. Includes bibliographical references and index. 1. Internet–Social aspects. 2. Information society. I. Scholz, Trebor. HM851.D538 2013 302.23'1–dc23 2012012133 ISBN: 978-0-415-89694-8 (hbk) ISBN: 978-0-415-89695-5 (pbk) ISBN: 978-0-203-14579-1 (ebk) Typeset in ApexBembo by Apex CoVantage, LLC CONTENTS Acknowledgments vii Introduction: Why Does Digital
    [Show full text]
  • I Found Work on an Amazon Website. I Made 97 Cents an Hour. - the New York Times Crossword Times Insider Newsletters the Learning Network
    11/15/2019 I Found Work on an Amazon Website. I Made 97 Cents an Hour. - The New York Times Crossword Times Insider Newsletters The Learning Network Multimedia Photography Podcasts NYT Store NYT Wine Club nytEducation Times Journeys Meal Kits Subscribe Manage Account Today's Paper Tools & Services Jobs Classifieds Corrections More Site Mobile Navigation 12 I Found Work on an Amazon Website. I Made 97 Cents an Hour. By ANDY NEWMAN NOV. 15, 2019 Inside the weird, wild, low-wage world of Mechanical Turk. https://www.nytimes.com/interactive/2019/11/15/nyregion/amazon-mechanical-turk.html 2/15 11/15/2019 I Found Work on an Amazon Website. I Made 97 Cents an Hour. - The New York Times After turking for eight hours, the author had earned $7.83. Dave Sanders for The New York Times The computer showed a photo of what looked like a school board meeting. My job was to rate it on a scale of 1 to 5 for 23 different qualities: “patriotic,” “elitist,” “reassuring” and so on. I did the same for a photo of a woman wearing headphones — I gave her a 4 for “competent” and a 1 for “threatening” — and another of five smiling women flanking a smiling man in a blue windbreaker. I submitted my answers. I checked the clock. Three minutes had passed. I had just earned another 5 cents on a digital work marketplace run by Amazon called Mechanical Turk. At least I thought I had. Weeks later, I’m still not sure. There are lots of ways to make a little money in this world.
    [Show full text]
  • Privacy Experiences on Amazon Mechanical Turk
    113 “Our Privacy Needs to be Protected at All Costs”: Crowd Workers’ Privacy Experiences on Amazon Mechanical Turk HUICHUAN XIA, Syracuse University YANG WANG, Syracuse University YUN HUANG, Syracuse University ANUJ SHAH, Carnegie Mellon University Crowdsourcing platforms such as Amazon Mechanical Turk (MTurk) are widely used by organizations, researchers, and individuals to outsource a broad range of tasks to crowd workers. Prior research has shown that crowdsourcing can pose privacy risks (e.g., de-anonymization) to crowd workers. However, little is known about the specific privacy issues crowd workers have experienced and how they perceive the state ofprivacy in crowdsourcing. In this paper, we present results from an online survey of 435 MTurk crowd workers from the US, India, and other countries and areas. Our respondents reported different types of privacy concerns (e.g., data aggregation, profiling, scams), experiences of privacy losses (e.g., phishing, malware, stalking, targeted ads), and privacy expectations on MTurk (e.g., screening tasks). Respondents from multiple countries and areas reported experiences with the same privacy issues, suggesting that these problems may be endemic to the whole MTurk platform. We discuss challenges, high-level principles and concrete suggestions in protecting crowd workers’ privacy on MTurk and in crowdsourcing more broadly. CCS Concepts: • Information systems → Crowdsourcing; • Security and privacy → Human and societal aspects of security and privacy; • Human-centered computing → Computer supported cooperative work; Additional Key Words and Phrases: Crowdsourcing; Privacy; Amazon Mechanical Turk (MTurk) ACM Reference format: Huichuan Xia, Yang Wang, Yun Huang, and Anuj Shah. 2017. “Our Privacy Needs to be Protected at All Costs”: Crowd Workers’ Privacy Experiences on Amazon Mechanical Turk.
    [Show full text]
  • Crowd Economy and Digital Precarity
    Crowd Economy Denis Jaromil Roio Planetary Collegium / M-Node Plymouth, 10 July 2010 Plymouth, 10 July 2010 1 / Denis Jaromil Roio (2010) Crowd Economy 19 Outline 1 Crowdsourcing 2 Everyone is an Artist 3 Mechanical Turks 4 Conclusion Plymouth, 10 July 2010 2 / Denis Jaromil Roio (2010) Crowd Economy 19 Crowdsourcing Crowdsourcing The term crowdsourcing indicates the act of outsourcing tasks, traditionally performed by an employee or contractor, to a large group of people (a crowd): the trend of leveraging the mass collaboration enabled by Web 2.0 technologies to achieve business goals. Crowdsourcing constituted a new form of corporate outsourcing to largely amateur pools of “volunteer labor that create content, solve problems, and even do corporate R & D.1” 1Howe, 2006 Plymouth, 10 July 2010 3 / Denis Jaromil Roio (2010) Crowd Economy 19 Crowdsourcing ESP Games “5000 people playing simultaneously an ESP game on image recognition can label all images on google in 30 days. Individual games in Yahoo! and MSN average over 5000 players at a time.”2 To address the problem of creating difficult metadata, ESP uses the computational power of humans to perform a task that computers cannot yet do by packaging the task as a “game”. 2von Ahn, 2006 Plymouth, 10 July 2010 4 / Denis Jaromil Roio (2010) Crowd Economy 19 Crowdsourcing Massive Multiplayer Online RPG MMORPG World of Warcraft Second Life OpenSIM etc. Virtual reality architecture Virtual miners Plymouth, 10 July 2010 5 / Denis Jaromil Roio (2010) Crowd Economy 19 Crowdsourcing Electronic Design Automation When crowdsourcing EDA, complex problems can be broken up into modules where the I/O of logic circuits is tested against combinations computed by humans.3 3Romero, 2009 Plymouth, 10 July 2010 6 / Denis Jaromil Roio (2010) Crowd Economy 19 Crowdsourcing Functional transormation Interested in the liberation of the means of production, Berthold Brecht elaborated the concept of functional transormation (Umfunktionierung) for the transformation of the forms and instruments of production [by a progressive intelligentsia].
    [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]
  • Chess by Vincent Diepeveen
    Chess by Vincent Diepeveen Chess History Chess found its origin in India well over 1500 years ago th Most sources quote the 6 century A.D. and even before that.. From India it reaches Persia (Iran) The rules gradually change; the queen and bishop become more powerful and the pawn can move two squares The name Chess comes from the Persian word for king: Shah Chess Some centuries later, Muslim rulers who conquer Persia spread the game of chess to Europe th Around the 15 century the rules start to be similar to todays chess rules Where rules are pretty much the same since then, the way the pieces look like definitely isn't, not even today! th Most western tournaments the standard is Staunton, from 19 century UK Original Staunton 1849 Replica's are already around $2000 a set Russian Chess pieces (modern) Actually similar (cheaper) sets you can encounter in the east in tournaments; the below set is already a couple of hundreds of dollars in the stores – note shape similar to Staunton Renaissance Style Chess pieces Please note that there is no cross on the king It's possible Staunton gets that credit... Most chessplayers find this easier Blindfolded Chess Actually chess players don't need to see the chess pieces at all Nearly all titled chess players can play blindfolded Question for the audience: How strong do titled chess players play blindfolded? Blindfolded Strength Playing regularly blindfolded hardly loses strength to OTB (over the board) Own experience: The first few moves after opening are actually the hardest moves
    [Show full text]
  • Designing a Pervasive Chess Game
    Designing a pervasive chess game André Pereira, Carlos Martinho, Iolanda Leite, Rui Prada, Ana Paiva Instituto Superior Técnico – Technical University of Lisbon and INESC-ID, AV. Professor Cavaco Silva – Taguspark 2780-990 Porto Salvo, Portugal {Andre.Pereira, Carlos.Martinho, Iolanda.Leite, Rui Prada}@tagus.ist.utl.pt, [email protected] Abstract. Chess is an ancient and widely popular tabletop game. For more than 1500 years of history chess has survived every civilization it has touched. One of its heirs, computerized chess, was one of the first artificial intelligence research areas and was highly important for the development of A.I. throughout the twentieth-century. This change of paradigm between a tabletop and a computerized game has its ups and downs. Computation can be used, for example, to simulate opponents in a virtual scenario, but the real essence of chess in which two human opponents battle face-to-face in that familiar black and white chessboard is lost. Usually, computer chess research focuses on improving the effectiveness of chess algorithms. This research, on the other hand, focuses on trying to bring back the essence of real world chess to a computerized scenario. To achieve this goal, in this paper we describe a model inspired by the field of Pervasive Gaming, a field that profits by the mix of real, virtual and social game elements. Keywords: Chess, Pervasive Gaming, Tangible User Interfaces, Graphical User Interfaces, Design Model, Agents. 1 Introduction “Pervasive gaming brings computer entertainment back to the real world” [14] and by doing so overcomes some restrictions of conventional computer games.
    [Show full text]
  • Crowdsourcing Language Resources for Dutch Using PYBOSSA: Case Studies on Blends, Neologisms and Language Variation
    Crowdsourcing Language Resources for Dutch using PYBOSSA: Case Studies on Blends, Neologisms and Language Variation Peter Dekker, Tanneke Schoonheim Instituut voor de Nederlandse Taal (Dutch Language Institute) {peter.dekker,tanneke.schoonheim}@ivdnt.org Abstract In this paper, we evaluate PYBOSSA, an open-source crowdsourcing framework, by performing case studies on blends, neologisms and language variation. We describe the procedural aspects of crowdsourcing, such as working with a crowdsourcing platform and reaching the desired audience. Furthermore, we analyze the results, and show that crowdsourcing can shed new light on how language is used by speakers. Keywords: crowdsourcing, lexicography, neologisms, language variation 1. Introduction Open-task crowdsourcing has been applied to lexicography Crowdsourcing (or: citizen science) has shown to be a for other languages, such as Slovene, where crowdsourcing quick and cost-efficient way to perform tasks by a large was integrated in the thesaurus and collocation dictionary number of lay people, which normally have to be per- applications (Holdt et al., 2018; Kosem et al., 2018). On formed by a small number of experts (Holley, 2010; Causer top of this goal of language documentation, we would like et al., 2018). In this paper, we use the PYBOSSA (PB) to use crowdsourcing to make language material available framework1 for crowdsourcing language resources for the for language learners. Dutch language. We will describe our experiences with this framework, to accomplish the goals of language doc- 2. Method umentation and generation of language learning material. In addition to sharing our experiences, we will report on As the basis for our experiments, we hosted an instance linguistic findings based on the experiments we performed of PYBOSSA at our institute.
    [Show full text]
  • Mechanical Turk
    Mechanical Turk W ILLIAM LUNDIN FORS S É N and ADAM RENBERG Bachelor of Science Thesis Stockholm, Sweden 2010 Mechanical Turk W ILLIAM LUNDIN FORS S É N and ADAM RENBERG Bachelor’s Thesis in Computer Science (15 ECTS credits) at the School of Computer Science and Engineering Royal Institute of Technology year 2010 Supervisor at CSC was Mads Dam Examiner was Mads Dam URL: www.csc.kth.se/utbildning/kandidatexjobb/datateknik/2010/ lundin_forssen_william_OCH_renberg_adam_K10066.pdf Royal Institute of Technology School of Computer Science and Communication KTH CSC 100 44 Stockholm URL: www.kth.se/csc Abstract Amazon Mechanical Turk (mTurk) is an infrastructure where tasks can be published for a crowd to solve. Those publishing the tasks reward the crowd for solving them. The system has increased in popularity since its release in 2005 but is still in a beta stage. This paper surveys the infrastructure, suggests improvements and debates the social and ethical questions that has arisen, such as "is this a virtual sweatshop?". We investigate the similarities and differences between this presumed virtual sweatshop and real world ones, and find that they closely resemble each other in wages and the menial nature of the tasks performed, but that they differ in working conditions and legal complexities. Referat Mechanical Turk Amazon Mechanical Turk (mTurk) är en infrastruktur där uppgifter kan publiceras för en folkmassa att lösa. De som publicerar uppgifterna belönar folkmassan för att lösa dem. Systemet har ökat i popularitet sedan dess uppstart 2005, men är fortfarande i ett beta-stadium. Denna uppsats undersöker dess infrastruktur, föreslår förbättringar och debat- terar de sociala och etiska frågor som uppstått, såsom "Är detta en virtuell sweatshop?".
    [Show full text]
  • Guide to Chess.Pdf
    A Guide to the Wiki For “The Game of Chess” By Allan Stewart DISCLAIMER: I started writing up this guide when I believed there was a writing requirement beyond the wiki. Instead I decided to focus on the wiki. So this short document is very meta. Consider it a guide to the wiki, or if you miss my presentation, a good overview of the ideas I cover. STRUCTURE OF THE PROJECT I chose chess as my topic because it is the premier game of Western culture. Although a game, it is not trivial at all. The evolution of chess has touched so many “human” elements in society. Conversely, the issue of whether chess (or any logic-based mechanism) is human – ie. requiring human intelligence – is of more recent interest. Regarding the evolution of chess, I see that the course has proceeded in the following way: 1. “Archaic” chess is when chess was in its foundations, before it was solidified 2. “Modern” chess is when mankind decides to place its face on the chess pieces and symbols 3. “Contemporary” chess addresses the motivations of more recent chess players Although this is a chronological approach, I argue that it produces a building foundation. In my opinion, chess has only gained complexity as humans interact with it and chess interacts with us. ARCHAIC CHESS “Chess: Origins and Myth” - plus its appended photo page – covers this extensively. Chess, believed to be quite old for reasons of its widespread distribution, is actually recent. Chess dates to later than Christ's birth and thus it is a game born in between the classical age and medieval times.
    [Show full text]