The low-noise full-pile-removal conjecture for noisy Nim
Statement
Let denote the probability of winning from a heap of size when each transmitted binary digit is independently erroneous with probability . A move transmits the number of chips left in the heap, and the full-pile-removal move transmits . Low-noise full-pile-removal conjecture. For and , , and optimal play is to transmit the removal of the entire pile. This conjecture is based on computations for heaps of sizes up to ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.