Vexing Vexillological Logic
Combinatorics
2022-12-22 v1 Computational Complexity
Discrete Mathematics
Abstract
We define a new impartial combinatorial game, Flag Coloring, based on flood filling. We then generalize to a graph game, and find values for many positions on two colors. We demonstrate that the generalized game is PSPACE-complete for two colors or more via a reduction from Avoid True, determine the outcome classes of games based on real-world flags, and discuss remaining open problems.
Keywords
Cite
@article{arxiv.2212.10631,
title = {Vexing Vexillological Logic},
author = {Kyle Burke and Craig Tennenhouse},
journal= {arXiv preprint arXiv:2212.10631},
year = {2022}
}
Comments
22 pages, 8 figures, 10 tables