ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A full 2×n2\times n board is a board with two rows and nn columns, initially containing a button in every cell; the board has C=2C=2 colors when its buttons use two colors. Here, ss denotes a constant independent of nn.

Two-row Buttons & Scissors conjecture. There is a polynomial-time algorithm that removes all but ss buttons from any full 2×n2\times n board with C=2C=2 colors, for some constant ss.

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

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.