ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Nk(p)N_k(p) denote the probability of winning from a heap of size kk when each transmitted binary digit is independently erroneous with probability pp. A move transmits the number of chips left in the heap, and the full-pile-removal move transmits 00. Low-noise full-pile-removal conjecture. For p≤12p\leq \frac{1}{2} and k≥1k\geq 1, Nk(p)≥12N_k(p)\geq \frac{1}{2}, and optimal play is to transmit the removal of the entire pile. This conjecture is based on computations for heaps of sizes up to 1010; its general validity is not established in the supplied text.

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.