activity
20202023
most citedComplexity of Solo Chess with Unlimited Moves

2 citations · 3 across the 7 of their papers we have counts for

collaborators
Showing cs.CCShow all

7 papers · 1 filter

cs.CC2023

Complexity of Reconfiguration in Surface Chemical Reaction Networks

Robert M. Alaniz, Josh Brunner, Michael Coulombe +9

We analyze the computational complexity of basic reconfiguration problems for the recently introduced surface Chemical Reaction Networks (sCRNs), where ordered pairs of adjacent sp…

cs.CC2023★ 2 cited

Complexity of Solo Chess with Unlimited Moves

Josh Brunner, Lily Chung, Michael Coulombe +3

We analyze Solo Chess puzzles, where the input is an board containing some standard Chess pieces of the same color, and the goal is to make a sequence of capture moves…

cs.CC2023

This Game Is Not Going To Analyze Itself

Aviv Adler, Hayashi Ani, Lily Chung +5

We analyze the puzzle video game This Game Is Not Going To Load Itself, where the player routes data packets of three different colors from given sources to given sinks of the corr…

cs.CC2022

Characterizing the Decidability of Finite State Automata Team Games with Communication

Michael Coulombe, Jayson Lynch

In this paper we define a new model of limited communication for multiplayer team games of imperfect information. We prove that the Team DFA Game and Team Formula Game, which have…

cs.CC2022

The Legend of Zelda: The Complexity of Mechanics

Jeffrey Bosboom, Josh Brunner, Michael Coulombe +4

We analyze some of the many game mechanics available to Link in the classic Legend of Zelda series of video games. In each case, we prove that the generalized game with that mechan…

cs.CC2020

Tetris is NP-hard even with rows or columns

Sualeh Asif, Michael Coulombe, Erik D. Demaine +4

We prove that the classic falling-block video game Tetris (both survival and board clearing) remains NP-complete even when restricted to 8 columns, or to 4 rows, settling open prob…

cs.CC2020

Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players

Jeffrey Bosboom, Charlotte Chen, Lily Chung +12

We analyze the computational complexity of several new variants of edge-matching puzzles. First we analyze inequality (instead of equality) constraints between adjacent tiles, prov…