ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let P\mathcal{P} be the existing piece alphabet, let PP be a single additional piece whose move total TP(n)T_P(n) is a polynomial in nn of degree at most 33, and let P′=P∪{P}\mathcal{P}'=\mathcal{P}\cup\{P\}. Strength is measured by the paper's uniformly random-arrow probability on the n×nn\times n board.

Triple-coincidence conjecture. For every integer n≥4n\geq4, no three distinct pieces in P′\mathcal{P}' share the same strength on the n×nn\times n board.

This asks whether the absence of triple strength coincidences persists after adjoining one piece of the stated polynomial complexity; the claim is presented as a further question and no resolution is given.

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.