Vexing Vexillological Logic

12/20/2022
by   Kyle Burke, et al.
0

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.

READ FULL TEXT
research
11/23/2019

Hardness of some variants of the graph coloring game

Very recently, a long-standing open question proposed by Bodlaender in 1...
research
07/29/2019

A Connected Version of the Graph Coloring Game

The graph coloring game is a two-player game in which, given a graph G a...
research
11/11/2020

Mastermind with a Linear Number of Queries

Since the 60's Mastermind has been studied for the combinatorial and inf...
research
09/07/2021

Impatient PPSZ – a Faster algorithm for CSP

PPSZ is the fastest known algorithm for (d,k)-CSP problems, for most val...
research
01/15/2023

Forced Capture Hnefatafl

We define a new, partizan, loopy combinatorial game, Forced-Capture Hnef...
research
01/18/2021

Transverse Wave: an impartial color-propagation game inspired by Social Influence and Quantum Nim

In this paper, we study a colorful, impartial combinatorial game played ...
research
06/08/2023

Generalized four person hat game

This paper studies Ebert's hat problem with four players and two colors,...

Please sign up or login with your details

Forgot password? Click here to reset