Strings-and-Coins and Nimstring are PSPACE-complete
-
Erik D. Demaine
Abstract
We prove that Strings-and-Coins, the combinatorial two-player game generalizing the dual of Dots-and-Boxes, is strongly PSPACE-complete on multigraphs. This result improves the best previous result, NP-hardness, argued in Winning Ways. Our result also applies to the Nimstring variant, where the winner is determined by normal play; indeed, one step in our reduction is the standard reduction (also from Winning Ways) from Nimstring to Strings-and-Coins.
Abstract
We prove that Strings-and-Coins, the combinatorial two-player game generalizing the dual of Dots-and-Boxes, is strongly PSPACE-complete on multigraphs. This result improves the best previous result, NP-hardness, argued in Winning Ways. Our result also applies to the Nimstring variant, where the winner is determined by normal play; indeed, one step in our reduction is the standard reduction (also from Winning Ways) from Nimstring to Strings-and-Coins.
Kapitel in diesem Buch
- Frontmatter I
- Preface V
- Contents XIII
- The game of flipping coins 1
- The game of blocking pebbles 17
- Transverse Wave: an impartial color-propagation game inspired by social influence and Quantum Nim 39
- A note on numbers 67
- Ordinal sums, clockwise hackenbush, and domino shave 77
- Advances in finding ideal play on poset games 99
- Strings-and-Coins and Nimstring are PSPACE-complete 109
- Partizan subtraction games 121
- Circular Nim games CN(7, 4) 139
- Misère domineering on 2 × n boards 157
- Relator games on groups 171
- Playing Bynum’s game cautiously 201
- Genetically modified games 229
- Game values of arithmetic functions 245
- A base-p Sprague–Grundy-type theorem for p-calm subtraction games: Welter’s game and representations of generalized symmetric groups 281
- Recursive comparison tests for dicot and dead-ending games under misère play 309
- Impartial games with entailing moves 323
- Extended Sprague–Grundy theory for locally finite games, and applications to random game-trees 343
- Grundy numbers of impartial three-dimensional chocolate-bar games 367
- On the structure of misère impartial games 389
Kapitel in diesem Buch
- Frontmatter I
- Preface V
- Contents XIII
- The game of flipping coins 1
- The game of blocking pebbles 17
- Transverse Wave: an impartial color-propagation game inspired by social influence and Quantum Nim 39
- A note on numbers 67
- Ordinal sums, clockwise hackenbush, and domino shave 77
- Advances in finding ideal play on poset games 99
- Strings-and-Coins and Nimstring are PSPACE-complete 109
- Partizan subtraction games 121
- Circular Nim games CN(7, 4) 139
- Misère domineering on 2 × n boards 157
- Relator games on groups 171
- Playing Bynum’s game cautiously 201
- Genetically modified games 229
- Game values of arithmetic functions 245
- A base-p Sprague–Grundy-type theorem for p-calm subtraction games: Welter’s game and representations of generalized symmetric groups 281
- Recursive comparison tests for dicot and dead-ending games under misère play 309
- Impartial games with entailing moves 323
- Extended Sprague–Grundy theory for locally finite games, and applications to random game-trees 343
- Grundy numbers of impartial three-dimensional chocolate-bar games 367
- On the structure of misère impartial games 389
