Polynomial-time approximation conjecture for two-row Buttons & Scissors boards
Statement
A full board is a board with two rows and columns, initially containing a button in every cell; the board has colors when its buttons use two colors. Here, denotes a constant independent of .
Two-row Buttons & Scissors conjecture. There is a polynomial-time algorithm that removes all but buttons from any full board with colors, for some constant .
This conjecture concerns the unresolved algorithmic complexity of restricted one-player Buttons & Scissors puzzles. It asserts that boards with two rows and two colors can always be reduced to a constant number of remaining buttons in polynomial time, rather than necessarily solved completely.
Record
- Source
- Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Löffler, Aaron Santiago, Christiane Schmidt, Ryuhei Uehara, Yushi Uno and Aaron Williams, “Single-Player and Two-Player Buttons & Scissors Games”, arXiv:1607.01826 (2016).
- MathDB
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.