ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Assume k=j=2k=j=2, so the hider caches two nuts and the searcher aims to find both. A hiding strategy is represented by pairs (y1,y2)(y_1,y_2) of depths, with the hole placements randomized as described in the source. Pair-distribution conjecture. For every nn and hh, there exists an optimal hiding strategy that is a probability distribution over such pairs, with the two holes selected uniformly from the (n+12){n+1\choose2} choices and the two possible depth assignments symmetrized; if the same hole is selected twice, one nut is placed at depth 11. This is presented as a simplifying structural conjecture; the source says it does not seem difficult but gives no proof.

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.