The power-of-two noisy Nim conjecture
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 denotes a heap size that is a power of two. Power-of-two noisy Nim conjecture. If , then for all . For , the optimal move is to transmit . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.