Triple-coincidence non-occurrence under single-piece extension
Statement
Let be the existing piece alphabet, let be a single additional piece whose move total is a polynomial in of degree at most , and let . Strength is measured by the paper's uniformly random-arrow probability on the board.
Triple-coincidence conjecture. For every integer , no three distinct pieces in share the same strength on the 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.