Complexity and Retrograde Analysis of the Game Dou Shou Qi
|
|
|
- Posy Walters
- 5 years ago
- Views:
Transcription
1 Complexity and Retrograde Analysis of the Game Dou Shou Qi Jan N. van Rijn Jonathan K. Vis Leiden Institute of Advanced Computer Science November 7, 2013 Jan N. van Rijn, Jonathan K. Vis (LIACS) Complexity of Dou Shou Qi November 7, / 21
2 Dou Shou Qi Pieces with their strength Elephant (8) Lion (7) Tiger (6) Panther (5) Dog (4) Wolf (3) Cat (2) Rat (1) Terrain types Den objective square Traps reduce enemy strength Water impassable squares Jan N. van Rijn, Jonathan K. Vis (LIACS) Complexity of Dou Shou Qi November 7, / 21
3 Dou Shou Qi Movement All pieces can move one square either horizontally or vertically Den Pieces cannot enter their own den Traps Pieces are vulnerable to any enemy piece Water Pieces cannot enter the water,... Jan N. van Rijn, Jonathan K. Vis (LIACS) Complexity of Dou Shou Qi November 7, / 21
4 Dou Shou Qi Swimming Rats can enter the water Capturing The Rat (weakest) can capture the Elephant (strongest) Exception Rats cannot capture the elephant from the water Jan N. van Rijn, Jonathan K. Vis (LIACS) Complexity of Dou Shou Qi November 7, / 21
5 Dou Shou Qi Leaping Lions and tigers can leap over the water, both horizontally and vertically Blocked Rats in the water block a leap Jan N. van Rijn, Jonathan K. Vis (LIACS) Complexity of Dou Shou Qi November 7, / 21
6 Circuit Game CNF formula (x y)... (x z w) Jan N. van Rijn, Jonathan K. Vis (LIACS) Complexity of Dou Shou Qi November 7, / 21
7 Circuit Game CNF formula (x y)... (x z w) Jan N. van Rijn, Jonathan K. Vis (LIACS) Complexity of Dou Shou Qi November 7, / 21
8 Planar Circuit Game (a) Half crossover (b) Crossover Jan N. van Rijn, Jonathan K. Vis (LIACS) Complexity of Dou Shou Qi November 7, / 21
9 Reductions R.A. Hearn G pos (POS CNF) p Circuit Game p Planar Circuit Game Our contribution Planar Circuit Game p Dou Shou Qi Construct gadgets: AND OR FANOUT CHOICE VARIABLE Jan N. van Rijn, Jonathan K. Vis (LIACS) Complexity of Dou Shou Qi November 7, / 21
10 Gadgets (a) VARIABLE Jan N. van Rijn, Jonathan K. Vis (LIACS) Complexity of Dou Shou Qi November 7, / 21
11 Gadgets (b) AND (c) OR Jan N. van Rijn, Jonathan K. Vis (LIACS) Complexity of Dou Shou Qi November 7, / 21
12 Gadgets (d) FANOUT (e) CHOICE Jan N. van Rijn, Jonathan K. Vis (LIACS) Complexity of Dou Shou Qi November 7, / 21
13 Unwanted behavior Problems White panthers can go back, effectively reversing the signal in the logic circuit Additional panthers can leave the FANOUT gadget through the same exit, effectively doubling the signal in the logic circuit Black pieces can escape their gadgets, and possibly destroy other gadgets Jan N. van Rijn, Jonathan K. Vis (LIACS) Complexity of Dou Shou Qi November 7, / 21
14 Unwanted behavior Problems White panthers can go back, effectively reversing the signal in the logic circuit Additional panthers can leave the FANOUT gadget through the same exit, effectively doubling the signal in the logic circuit Black pieces can escape their gadgets, and possibly destroy other gadgets Solution Create additional protector gadgets that prevent this behavior Jan N. van Rijn, Jonathan K. Vis (LIACS) Complexity of Dou Shou Qi November 7, / 21
15 Protector Gadgets One way gadget Jan N. van Rijn, Jonathan K. Vis (LIACS) Complexity of Dou Shou Qi November 7, / 21
16 Protector Gadgets Preventing multiple panthers through one exit Jan N. van Rijn, Jonathan K. Vis (LIACS) Complexity of Dou Shou Qi November 7, / 21
17 Protector Gadgets Prevents black pieces from leaving their gadget Jan N. van Rijn, Jonathan K. Vis (LIACS) Complexity of Dou Shou Qi November 7, / 21
18 PSPACE-hardness Complexity Dou Shou Qi is PSPACE-hard Completeness Under the assumption of a 50-move rule, PSPACE-completeness can trivially be proven. Open Problem We suspect Dou Shou Qi to be EXPTIME-complete, but could not prove it yet. Jan N. van Rijn, Jonathan K. Vis (LIACS) Complexity of Dou Shou Qi November 7, / 21
19 Jan N. van Rijn, Jonathan K. Vis (LIACS) Complexity of Dou Shou Qi November 7, / 21
20 Retrograde Analysis Endgame tablebase with positions up to four pieces Calculating backwards from terminal positions Containing almost positions Approximately 2% ends in a draw Goals: Search for interesting patterns Use it as part of the playing engine Jan N. van Rijn, Jonathan K. Vis (LIACS) Complexity of Dou Shou Qi November 7, / 21
21 Retrograde Analysis Endgame tablebase with positions up to four pieces Calculating backwards from terminal positions Containing almost positions Approximately 2% ends in a draw Goals: Search for interesting patterns Use it as part of the playing engine Solve Dou Shou Qi in a similar way as Checkers was solved Jan N. van Rijn, Jonathan K. Vis (LIACS) Complexity of Dou Shou Qi November 7, / 21
22 Retrograde Analysis White to play, what is the outcome? Jan N. van Rijn, Jonathan K. Vis (LIACS) Complexity of Dou Shou Qi November 7, / 21
23 Retrograde Analysis White loses No draws for two equal pieces Distance parity is important Tigers and Lion can flip parity White to play, what is the outcome? Jan N. van Rijn, Jonathan K. Vis (LIACS) Complexity of Dou Shou Qi November 7, / 21
24 Conclusions and Future Work Dou Shou Qi is PSPACE-hard, which implies that it is an interesting game to study Implementations available 1 : playing engine, web interface and endgame tablebase Room for improvement: Can it be proven EXPTIME-complete? A reduction on a more regular board More interesting patterns can be found in the endgame tablebase 1 Jan N. van Rijn, Jonathan K. Vis (LIACS) Complexity of Dou Shou Qi November 7, / 21
25 Questions Thank you for your attention. Jan N. van Rijn, Jonathan K. Vis (LIACS) Complexity of Dou Shou Qi November 7, / 21
Lecture 19 November 6, 2014
6.890: Algorithmic Lower Bounds: Fun With Hardness Proofs Fall 2014 Prof. Erik Demaine Lecture 19 November 6, 2014 Scribes: Jeffrey Shen, Kevin Wu 1 Overview Today, we ll cover a few more 2 player games
Amazons, Konane, and Cross Purposes are PSPACE-complete
Games of No Chance 3 MSRI Publications Volume 56, 2009 Amazons, Konane, and Cross Purposes are PSPACE-complete ROBERT A. HEARN ABSTRACT. Amazons is a board game which combines elements of Chess and Go.
Universiteit Leiden Computer Science
Universiteit Leiden Computer Science Retrograde Analysis and Proof Number Search Applied to Jungle Checkers Name: Michiel Sebastiaan Vos Date: 24/02/2016 1st supervisor: Prof. Dr. A. (Aske) Plaat 2nd supervisor:
arxiv:cs/ v2 [cs.cc] 27 Jul 2001
![arxiv:cs/ v2 [cs.cc] 27 Jul 2001](/thumbs/90/103930414.jpg "arxiv:cs/ v2 [cs.cc] 27 Jul 2001")
Phutball Endgames are Hard Erik D. Demaine Martin L. Demaine David Eppstein arxiv:cs/0008025v2 [cs.cc] 27 Jul 2001 Abstract We show that, in John Conway s board game Phutball (or Philosopher s Football),
Generalized Amazons is PSPACE Complete
Generalized Amazons is PSPACE Complete Timothy Furtak 1, Masashi Kiyomi 2, Takeaki Uno 3, Michael Buro 4 1,4 Department of Computing Science, University of Alberta, Edmonton, Canada. email: { 1 furtak,
arxiv: v1 [cs.cc] 12 Dec 2017
![arxiv: v1 [cs.cc] 12 Dec 2017](/thumbs/93/111777611.jpg "arxiv: v1 [cs.cc] 12 Dec 2017")
Computational Properties of Slime Trail arxiv:1712.04496v1 [cs.cc] 12 Dec 2017 Matthew Ferland and Kyle Burke July 9, 2018 Abstract We investigate the combinatorial game Slime Trail. This game is played
arxiv: v1 [cs.cc] 14 Jun 2018
![arxiv: v1 [cs.cc] 14 Jun 2018](/thumbs/83/88407549.jpg "arxiv: v1 [cs.cc] 14 Jun 2018")
Losing at Checkers is Hard Jeffrey Bosboom Spencer Congero Erik D. Demaine Martin L. Demaine Jayson Lynch arxiv:1806.05657v1 [cs.cc] 14 Jun 2018 Abstract We prove computational intractability of variants
Easy to Win, Hard to Master:
Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs Joint work with Martin Zimmermann Alexander Weinert Saarland University December 13th, 216 MFV Seminar, ULB, Brussels, Belgium
Lecture 20 November 13, 2014
6.890: Algorithmic Lower Bounds: Fun With Hardness Proofs Fall 2014 Prof. Erik Demaine Lecture 20 November 13, 2014 Scribes: Chennah Heroor 1 Overview This lecture completes our lectures on game characterization.
Scrabble is PSPACE-Complete
Scrabble is PSPACE-Complete Michael Lampis 1, Valia Mitsou 2, and Karolina So ltys 3 1 KTH Royal Institute of Technology, mlampis@kth.se 2 Graduate Center, City University of New York, vmitsou@gc.cuny.edu
arxiv: v2 [cs.cc] 29 Dec 2017
![arxiv: v2 [cs.cc] 29 Dec 2017](/thumbs/77/76105451.jpg "arxiv: v2 [cs.cc] 29 Dec 2017")
A handle is enough for a hard game of Pull arxiv:1605.08951v2 [cs.cc] 29 Dec 2017 Oscar Temprano oscartemp@hotmail.es Abstract We are going to show that some variants of a puzzle called pull in which the
Faithful Representations of Graphs by Islands in the Extended Grid
Faithful Representations of Graphs by Islands in the Extended Grid Michael D. Coury Pavol Hell Jan Kratochvíl Tomáš Vyskočil Department of Applied Mathematics and Institute for Theoretical Computer Science,
MULTINATIONAL WAR IS HARD
MULTINATIONAL WAR IS HARD JONATHAN WEED Abstract. War is a simple children s game with no apparent strategy. However, players do have the ability to influence the game s outcome by deciding how to return
YourTurnMyTurn.com: Reversi rules. Roel Hobo Copyright 2018 YourTurnMyTurn.com
YourTurnMyTurn.com: Reversi rules Roel Hobo Copyright 2018 YourTurnMyTurn.com Inhoud Reversi rules...1 Rules...1 Opening...3 Tabel 1: Openings...4 Midgame...5 Endgame...8 To conclude...9 i Reversi rules
CSCI 1590 Intro to Computational Complexity
CSCI 1590 Intro to Computational Complexity Parallel Computation and Complexity Classes John Savage Brown University April 13, 2009 John Savage (Brown University) CSCI 1590 Intro to Computational Complexity
arxiv: v1 [cs.gt] 29 Feb 2012
![arxiv: v1 [cs.gt] 29 Feb 2012](/thumbs/94/121696809.jpg "arxiv: v1 [cs.gt] 29 Feb 2012")
Lemmings is PSPACE-complete Giovanni Viglietta University of Pisa, Italy, viglietta@gmail.com arxiv:1202.6581v1 [cs.gt] 29 Feb 2012 Abstract. Lemmings is a computer puzzle game developed by DMA Design
Chess Algorithms Theory and Practice. Rune Djurhuus Chess Grandmaster / September 23, 2013
Chess Algorithms Theory and Practice Rune Djurhuus Chess Grandmaster runed@ifi.uio.no / runedj@microsoft.com September 23, 2013 1 Content Complexity of a chess game History of computer chess Search trees
MITOCW watch?v=ku8i8ljnqge
MITOCW watch?v=ku8i8ljnqge The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high-quality educational resources for free. To
2048 IS (PSPACE) HARD, BUT SOMETIMES EASY
2048 IS (PSPE) HRD, UT SOMETIMES ESY Rahul Mehta Princeton University rahulmehta@princeton.edu ugust 28, 2014 bstract arxiv:1408.6315v1 [cs.] 27 ug 2014 We prove that a variant of 2048, a popular online
Scrabble is PSPACE-Complete
Scrabble is PSPACE-Complete Michael Lampis, Valia Mitsou and Karolyna Soltys KTH, GC CUNY, MPI Scrabble is PSPACE-Complete p. 1/25 A famous game... Word game played on a grid 150 million sets sold in 121
Super Mario. Martin Ivanov ETH Zürich 5/27/2015 1
Super Mario Martin Ivanov ETH Zürich 5/27/2015 1 Super Mario Crash Course 1. Goal 2. Basic Enemies Goomba Koopa Troopas Piranha Plant 3. Power Ups Super Mushroom Fire Flower Super Start Coins 5/27/2015
Generation of Patterns With External Conditions for the Game of Go
Generation of Patterns With External Conditions for the Game of Go Tristan Cazenave 1 Abstract. Patterns databases are used to improve search in games. We have generated pattern databases for the game
On the fairness and complexity of generalized k-in-a-row games
Theoretical Computer Science 385 (2007) 88 100 www.elsevier.com/locate/tcs On the fairness and complexity of generalized k-in-a-row games Ming Yu Hsieh, Shi-Chun Tsai 1001 University Road, Department of
Dealing with some maths
Dealing with some maths Hayden Tronnolone School of Mathematical Sciences University of Adelaide August 20th, 2012 To call a spade a spade First, some dealing... Hayden Tronnolone (University of Adelaide)
Fraser Stewart Department of Mathematics and Statistics, Xi An Jiaotong University, Xi An, Shaanxi, China
#G3 INTEGES 13 (2013) PIATES AND TEASUE Fraser Stewart Department of Mathematics and Statistics, Xi An Jiaotong University, Xi An, Shaani, China fraseridstewart@gmail.com eceived: 8/14/12, Accepted: 3/23/13,
The Mathematics of Playing Tic Tac Toe
The Mathematics of Playing Tic Tac Toe by David Pleacher Although it has been shown that no one can ever win at Tic Tac Toe unless a player commits an error, the game still seems to have a universal appeal.
Introduction. Nothing can be done contrary to what could or would be done in actual war. Revised Rules for the NAVAL WAR GAME (1905) Fred T.
Design Parameters Introduction These rules have been developed so that it is possible to fight small World War II Ostfront battles between Axis and Soviet forces. The battles last about an hour or two
In the event that rules differ in the app from those described here, follow the app rules.
In the event that rules differ in the app from those described here, follow the app rules. Setup In the app, select the number of players and the quest. Place the starting map tiles as displayed in the
The Computational Complexity of Angry Birds and Similar Physics-Simulation Games
The Computational Complexity of Angry Birds and Similar Physics-Simulation Games Matthew Stephenson and Jochen Renz and Xiaoyu Ge Research School of Computer Science Australian National University Canberra,
arxiv: v1 [cs.cc] 2 Dec 2014
![arxiv: v1 [cs.cc] 2 Dec 2014](/thumbs/77/75076394.jpg "arxiv: v1 [cs.cc] 2 Dec 2014")
Braid is undecidable Linus Hamilton arxiv:1412.0784v1 [cs.cc] 2 Dec 2014 December 3, 2014 Abstract Braid is a 2008 puzzle game centered around the ability to reverse time. We show that Braid can simulate
Solving Kriegspiel endings with brute force: the case of KR vs. K
Solving Kriegspiel endings with brute force: the case of KR vs. K Paolo Ciancarini Gian Piero Favini University of Bologna 12th Int. Conf. On Advances in Computer Games, Pamplona, Spain, May 2009 The problem
More NP Complete Games Richard Carini and Connor Lemp February 17, 2015
More NP Complete Games Richard Carini and Connor Lemp February 17, 2015 Attempts to find an NP Hard Game 1 As mentioned in the previous writeup, the search for an NP Complete game requires a lot more thought
UNIT-III ASYNCHRONOUS SEQUENTIAL CIRCUITS TWO MARKS 1. What are secondary variables? -present state variables in asynchronous sequential circuits 2. What are excitation variables? -next state variables
Coin Flipping Magic Joseph Eitel! amagicclassroom.com
Coin Flipping Magic Put 3 coins on the desk. They can be different denominations if you like. Have 2 or 3 students at a desk. It is always best to have a few students do a trick together, especially if
Year 3 Maths Optional SAT Mark Scheme
Year 3 Maths Optional SAT Mark Scheme Paper A. Practice question - 35 [0]. 58 3. crossed out as shown: Accept any other clear way of indicating the correct number, such as a circle or a tick. Accept also
Universiteit Leiden Opleiding Informatica
Universiteit Leiden Opleiding Informatica Predicting the Outcome of the Game Othello Name: Simone Cammel Date: August 31, 2015 1st supervisor: 2nd supervisor: Walter Kosters Jeannette de Graaf BACHELOR
Achieving Desirable Gameplay Objectives by Niched Evolution of Game Parameters
Achieving Desirable Gameplay Objectives by Niched Evolution of Game Parameters Scott Watson, Andrew Vardy, Wolfgang Banzhaf Department of Computer Science Memorial University of Newfoundland St John s.
THE GAMES OF COMPUTER SCIENCE. Topics
THE GAMES OF COMPUTER SCIENCE TU DELFT Feb 23 2001 Games Workshop Games Workshop Peter van Emde Boas ILLC-FNWI-Univ. of Amsterdam References and slides available at: http://turing.wins.uva.nl/~peter/teaching/thmod00.html
Easy Games and Hard Games
Easy Games and Hard Games Igor Minevich April 30, 2014 Outline 1 Lights Out Puzzle 2 NP Completeness 3 Sokoban 4 Timeline 5 Mancala Original Lights Out Puzzle There is an m n grid of lamps that can be
The Complexity of Generalized Pipe Link Puzzles
[DOI: 10.2197/ipsjjip.25.724] Regular Paper The Complexity of Generalized Pipe Link Puzzles Akihiro Uejima 1,a) Hiroaki Suzuki 1 Atsuki Okada 1 Received: November 7, 2016, Accepted: May 16, 2017 Abstract:
LINEAR EQUATIONS IN TWO VARIABLES
LINEAR EQUATIONS IN TWO VARIABLES What You Should Learn Use slope to graph linear equations in two " variables. Find the slope of a line given two points on the line. Write linear equations in two variables.
Mario Kart Is Hard. Citation. As Published Publisher. Version
Mario Kart Is Hard The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher Bosboom, Jeffrey, Erik D. Demaine,
Midterm I Exam /657 Constructive Logic André Platzer. October 1, 2015
Midterm I Exam 15-317/657 Constructive Logic André Platzer October 1, 2015 Name: Andrew ID: Instructions Throughout this exam, explain whenever there are notable steps or choices or subtleties and justify
Surreal Numbers and Games. February 2010
Surreal Numbers and Games February 2010 1 Last week we began looking at doing arithmetic with impartial games using their Sprague-Grundy values. Today we ll look at an alternative way to represent games
Universiteit Leiden Opleiding Informatica
Universiteit Leiden Opleiding Informatica Solving and Constructing Kamaji Puzzles Name: Kelvin Kleijn Date: 27/08/2018 1st supervisor: dr. Jeanette de Graaf 2nd supervisor: dr. Walter Kosters BACHELOR
Using KenKen to Build Reasoning Skills 1
1 INTRODUCTION Using KenKen to Build Reasoning Skills 1 Harold Reiter Department of Mathematics, University of North Carolina Charlotte, Charlotte, NC 28223, USA hbreiter@email.uncc.edu John Thornton Charlotte,
MITOCW watch?v=x-ik9yafapo
MITOCW watch?v=x-ik9yafapo The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high quality educational resources for free. To
4.1 Patterns. Example 1 Find the patterns:
4.1 Patterns One definition of mathematics is the study of patterns. In this section, you will practice recognizing mathematical patterns in various problems. For each example, you will work with a partner
Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games
Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games Stephen A. Fenner University of South Carolina Daniel Grier MIT Thomas Thierauf Aalen University Jochen Messner
Problem Set 4 Due: Wednesday, November 12th, 2014
6.890: Algorithmic Lower Bounds Prof. Erik Demaine Fall 2014 Problem Set 4 Due: Wednesday, November 12th, 2014 Problem 1. Given a graph G = (V, E), a connected dominating set D V is a set of vertices such
Narrow misère Dots-and-Boxes
Games of No Chance 4 MSRI Publications Volume 63, 05 Narrow misère Dots-and-Boxes SÉBASTIEN COLLETTE, ERIK D. DEMAINE, MARTIN L. DEMAINE AND STEFAN LANGERMAN We study misère Dots-and-Boxes, where the goal
Keeping Your Distance is Hard
Keeping Your Distance is Hard Plymouth State Math Department Seminar Feb 11, 2016 Kyle Burke work with Silvia Heubach, Melissa Huggan, Svenja Huntemann, Placement Games Placement games are games where
Computational complexity of two-dimensional platform games
Computational complexity of two-dimensional platform games Michal Forišek Comenius University, Bratislava, Slovakia forisek@dcs.fmph.uniba.sk Abstract. We analyze the computational complexity of various
Good Luck To. DIRECTIONS: Answer each question and show all work in the space provided. The next two terms of the sequence are,
Good Luck To Period Date DIRECTIONS: Answer each question and show all work in the space provided. 1. Find the next two terms of the sequence. 6, 36, 216, 1296, _?_, _?_ The next two terms of the sequence
Animal Trading Cards ANIMALS
Purpose To learn about diversity in the animal kingdom by making and playing with animal trading cards. Process Skills Classify, Collect data, Communicate Background All animals share similar needs food,
Algorithms and Complexity for Japanese Puzzles
のダイジェスト ICALP Masterclass Talk: Algorithms and Complexity for Japanese Puzzles Ryuhei Uehara Japan Advanced Institute of Science and Technology uehara@jaist.ac.jp http://www.jaist.ac.jp/~uehara 2015/07/09
A Generalized Heuristic for Can t Stop
Proceedings of the Twenty-Second International FLAIRS Conference (009) A Generalized Heuristic for Can t Stop James Glenn and Christian Aloi Department of Computer Science Loyola College in Maryland Baltimore,
University of Alberta
University of Alberta Library Release Form Name of Author: Haizhi Zhong Title of Thesis: Building a Strong Arimaa-playing Program Degree: Master of Science Year this Degree Granted: 2005 Permission is
CHECKMATE! A Brief Introduction to Game Theory. Dan Garcia UC Berkeley. The World. Kasparov
CHECKMATE! The World A Brief Introduction to Game Theory Dan Garcia UC Berkeley Kasparov Welcome! Introduction Topic motivation, goals Talk overview Combinatorial game theory basics w/examples Computational
GC Gadgets in the Rush Hour. Game Complexity Gadgets in the Rush Hour. Walter Kosters, Universiteit Leiden
GC Gadgets in the Rush Hour Game Complexity Gadgets in the Rush Hour Walter Kosters, Universiteit Leiden www.liacs.leidenuniv.nl/ kosterswa/ IPA, Eindhoven; Friday, January 25, 209 link link link mystery
Lesson 16: The Computation of the Slope of a Non Vertical Line
++ Lesson 16: The Computation of the Slope of a Non Vertical Line Student Outcomes Students use similar triangles to explain why the slope is the same between any two distinct points on a non vertical
arxiv: v1 [cs.cc] 30 Nov 2016
![arxiv: v1 [cs.cc] 30 Nov 2016](/thumbs/75/72221650.jpg "arxiv: v1 [cs.cc] 30 Nov 2016")
The Computational Complexity of Portal and Other 3D Video Games Erik D. Demaine * Joshua Lockhart Jayson Lynch * arxiv:1611.10319v1 [cs.cc] 30 Nov 2016 Abstract We classify the computational complexity
Parallel Line Converse Theorems. Key Terms
A Reversed Condition Parallel Line Converse Theorems.5 Learning Goals Key Terms In this lesson, you will: Write parallel line converse conjectures. Prove parallel line converse conjectures. converse Corresponding
The Computational Complexity of Portal and Other 3D Video Games
The Computational Complexity of Portal and Other 3D Video Games Erik D. Demaine MIT CSAIL, 32 Vassar Street, Cambridge, MA 02139, USA edemaine@mit.edu Joshua Lockhart 1 Department of Computer Science,
arxiv: v1 [cs.cc] 12 Jul 2018
![arxiv: v1 [cs.cc] 12 Jul 2018](/thumbs/82/85073179.jpg "arxiv: v1 [cs.cc] 12 Jul 2018")
arxiv:1807.04724v1 [cs.cc] 12 Jul 2018 Computational Complexity of Games and Puzzles Diogo Manuel dos Santos Costa Thesis to obtain the Master of Science Degree in Information Systems and Computer Engineering
Blunder Cost in Go and Hex
Advances in Computer Games: 13th Intl. Conf. ACG 2011; Tilburg, Netherlands, Nov 2011, H.J. van den Herik and A. Plaat (eds.), Springer-Verlag Berlin LNCS 7168, 2012, pp 220-229 Blunder Cost in Go and
arxiv: v2 [cs.cc] 18 Mar 2013
![arxiv: v2 [cs.cc] 18 Mar 2013](/thumbs/74/71129996.jpg "arxiv: v2 [cs.cc] 18 Mar 2013")
Deciding the Winner of an Arbitrary Finite Poset Game is PSPACE-Complete Daniel Grier arxiv:1209.1750v2 [cs.cc] 18 Mar 2013 University of South Carolina grierd@email.sc.edu Abstract. A poset game is a
Review Energy Bands Carrier Density & Mobility Carrier Transport Generation and Recombination
Review Energy Bands Carrier Density & Mobility Carrier Transport Generation and Recombination Current Transport: Diffusion, Thermionic Emission & Tunneling For Diffusion current, the depletion layer is
I.M.O. Winter Training Camp 2008: Invariants and Monovariants
I.M.. Winter Training Camp 2008: Invariants and Monovariants n math contests, you will often find yourself trying to analyze a process of some sort. For example, consider the following two problems. Sample
Play with good sportsmanship and have fun!
Rules of the High Seas Here are some game concepts important to the Pirates Constructible Strategy Game (CSG) rules: Six-sided dice are abbreviated d6. Ability text (found on the fronts of cards) overrules
Classic Nintendo Games Are (Computationally) Hard
Classic Nintendo Games Are (Computationally) Hard The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher
Lecture 16 Scribe Notes
6.890: Algorithmic Lower Bounds: Fun With Hardness Proofs Fall 2014 Prof. Erik Demaine Lecture 16 Scribe Notes 1 Overview This class will come back to the games topic. We will see the results of the Gaming
Variations on Instant Insanity
Variations on Instant Insanity Erik D. Demaine 1, Martin L. Demaine 1, Sarah Eisenstat 1, Thomas D. Morgan 2, and Ryuhei Uehara 3 1 MIT Computer Science and Artificial Intelligence Laboratory, 32 Vassar
µpad: Proto Base Manual
µpad: Proto Base Manual Last Updated May 13, 2015 Table of Contents WARNING: READ BEFORE PROCEDING!... 7 Overview... Error! Bookmark not defined. µpad Base Connection... 8 Analog... 8 Amplifier Circuit...
MAT104: Fundamentals of Mathematics II Counting Techniques Class Exercises Solutions
MAT104: Fundamentals of Mathematics II Counting Techniques Class Exercises Solutions 1. Appetizers: Salads: Entrées: Desserts: 2. Letters: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U,
Small and large MCTS playouts applied to Chinese Dark Chess stochastic game
Small and large MCTS playouts applied to Chinese Dark Chess stochastic game Nicolas Jouandeau 1 and Tristan Cazenave 2 1 LIASD, Université de Paris 8, France n@ai.univ-paris8.fr 2 LAMSADE, Université Paris-Dauphine,
GAMES AND STRATEGY BEGINNERS 12/03/2017
GAMES AND STRATEGY BEGINNERS 12/03/2017 1. TAKE AWAY GAMES Below you will find 5 different Take Away Games, each of which you may have played last year. Play each game with your partner. Find the winning
QuiltCAD will be used to create an entire quilt layout. It can be used for single patterns, pantographs, borders, or sashings. There are some options
QuiltCAD will be used to create an entire quilt layout. It can be used for single patterns, pantographs, borders, or sashings. There are some options that only QuiltCAD can do when compared to other portions
Welcome to the Brain Games Chess Help File.
HELP FILE Welcome to the Brain Games Chess Help File. Chess a competitive strategy game dating back to the 15 th century helps to developer strategic thinking skills, memorization, and visualization of
IV. TROOPS FAQ SPECIALIZED UNITS 2
IV. TROOPS FAQ STANDARD UNITS 1 7 8 8 Infantry Move 0-1 and battle, or move 2 no battle May Take Ground on successful Close Assault Armor Move 0-3 and battle May Overrun on successful Close Assault Artillery
Playing games with algorithms: Algorithmic Combinatorial Game Theory
Surveys Games of No Chance 3 MSRI Publications Volume 56, 2009 Playing games with algorithms: Algorithmic Combinatorial Game Theory ERIK D. DEMAINE AND ROBERT A. HEARN ABSTRACT. Combinatorial games lead
Spatial Sounds (100dB at 100km/h) in the Context of Human Robot Personal Relationships
Spatial Sounds (100dB at 100km/h) in the Context of Human Robot Personal Relationships Edwin van der Heide Leiden University, LIACS Niels Bohrweg 1, 2333 CA Leiden, The Netherlands evdheide@liacs.nl Abstract.
Tac Due: Sep. 26, 2012
CS 195N 2D Game Engines Andy van Dam Tac Due: Sep. 26, 2012 Introduction This assignment involves a much more complex game than Tic-Tac-Toe, and in order to create it you ll need to add several features
Math 152 Rodriguez Blitzer 2.5 The Point-Slope Form of the Equation of a Line
Math 152 Rodriguez Blitzer 2.5 The Point-Slope Form of the Equation of a Line I. Point-Slope Form A. Linear equations we have seen so far: 1. standard form: Ax +By=C A, B, and C real numbers 2. slope-intercept
56th UNSW School Mathematics Competition
Parabola Volume 53, Issue 3 (2017) 56th UNSW School Mathematics ompetition Solutions by enis Potapov 1 Junior ivision Problems Problem 1: In the country igit-land, there are nine cities: 1, 2,..., 9. Two
The Computational Complexity of Games and Puzzles. Valia Mitsou
The Computational Complexity of Games and Puzzles Valia Mitsou Abstract The subject of my thesis is studying the algorithmic properties of one and two-player games people enjoy playing, such as chess or
Contents. MA 327/ECO 327 Introduction to Game Theory Fall 2017 Notes. 1 Wednesday, August Friday, August Monday, August 28 6
MA 327/ECO 327 Introduction to Game Theory Fall 2017 Notes Contents 1 Wednesday, August 23 4 2 Friday, August 25 5 3 Monday, August 28 6 4 Wednesday, August 30 8 5 Friday, September 1 9 6 Wednesday, September
Nim is Easy, Chess is Hard But Why??
Nim is Easy, Chess is Hard But Why?? Aviezri S. Fraenkel January 7, 2007 Department of Computer Science and Applied Mathematics Weizmann Institute of Science Rehovot 76100, Israel Abstract The game of
Learning About Learning. Resource 1a (Activity 2) Shape Picture Activity - Shape 1. Shark. reference for teacher after shape has been cut out
Resource 1a (Activity 2) Shape Picture Activity - Shape 1 reference for teacher after shape has been cut out Shark Resource 1b (Activity 2) Shape Picture Activity - Instructions 1 Station 1 Follow the
Structural Correction of a Spherical Near-Field Scanner for mm-wave Applications
Structural Correction of a Spherical Near-Field Scanner for mm-wave Applications Daniël Janse van Rensburg & Pieter Betjes Nearfield Systems Inc. 19730 Magellan Drive Torrance, CA 90502-1104, USA Abstract
CMSC 671 Project Report- Google AI Challenge: Planet Wars
1. Introduction Purpose The purpose of the project is to apply relevant AI techniques learned during the course with a view to develop an intelligent game playing bot for the game of Planet Wars. Planet
Gough, John , Mystery and movement: doing more with dominoes, Australian primary mathematics classroom, vol. 9, no. 1, pp
Deakin Research Online Deakin University s institutional research repository DDeakin Research Online Research Online This is the published version (version of record) of: Gough, John 2004-03, Mystery and
5.1 Graphing Sine and Cosine Functions.notebook. Chapter 5: Trigonometric Functions and Graphs
Chapter 5: Trigonometric Functions and Graphs 1 Chapter 5 5.1 Graphing Sine and Cosine Functions Pages 222 237 Complete the following table using your calculator. Round answers to the nearest tenth. 2
Multiple input gates. The AND gate
Multiple input gates Inverters and buffers exhaust the possibilities for single-input gate circuits. What more can be done with a single logic signal but to buffer it or invert it? To explore more logic
Quantified Boolean Formulas: Call the Plumber!
EPiC Series in Computing Volume 46, 2017, Pages 162 170 LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning Quantified Boolean Formulas: Call the Plumber!
Search In Combinatorial Spaces: Fun with puzzles and games
Search In Combinatorial Spaces: Fun with puzzles and games Bart Massey (Physics '87) Asst. Prof. Computer Science Portland State University bart@cs.pdx.edu Why puzzles and games? Vernor Vinge: Usenix 2005
MITOCW watch?v=7d73e1dih0w
MITOCW watch?v=7d73e1dih0w The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high quality educational resources for free. To
Tutorial: Creating maze games
Tutorial: Creating maze games Copyright 2003, Mark Overmars Last changed: March 22, 2003 (finished) Uses: version 5.0, advanced mode Level: Beginner Even though Game Maker is really simple to use and creating
One Jump Ahead. Jonathan Schaeffer Department of Computing Science University of Alberta
One Jump Ahead Jonathan Schaeffer Department of Computing Science University of Alberta jonathan@cs.ualberta.ca Research Inspiration Perspiration 1989-2007? Games and AI Research Building high-performance
Lesson 5: The Area of Polygons Through Composition and Decomposition
Lesson 5: The Area of Polygons Through Composition and Decomposition Student Outcomes Students show the area formula for the region bounded by a polygon by decomposing the region into triangles and other