Work

Dots & Boxes Is PSPACE-Complete

Year: 2021

Type: article

Abstract: Exactly 20 years ago at MFCS, Demaine posed the open problem whether the game of Dots & Boxes is PSPACE-complete. Dots & Boxes has been studied extensively, with for instance a chapter in Berlekamp et al. Winning Ways for Your Mathematical Plays, a whole book on the game The Dots and Boxes Game: Sophisticated Child's Play by Berlekamp, and numerous articles in the Games of No Chance series. While known to be NP-hard, the question of its complexity remained open. We resolve this question, proving that the game is PSPACE-complete by a reduction from a game played on propositional formulas.

Source: DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

DOI: 10.4230/lipics.mfcs.2021.25

Authors: Buchin, Kevin, Hagedoorn, Mart, Kostitsyna, Irina, van Mulken, Max

Institution: Eindhoven University of Technology

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W3195537460

FWCI:

Cites:

Cited by: 1

Related to: 20