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 k=2nk=2^n denotes a heap size that is a power of two. Power-of-two noisy Nim conjecture. If k=2nk=2^n, then Nk(p)≥12N_k(p)\geq \frac{1}{2} for all kk. For p≥12p\geq \frac{1}{2}, the optimal move is to transmit k−1k-1. This conjecture is based on the computed cases in the paper, and no resolution is stated 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.