The scout-number conjecture for effective exploration of integer grids
Statement
A scout process consists of scouts moving on according to a scout protocol . The hitting time of is , and the protocol is effective when every grid point has finite mean hitting time. It is known that scouts suffice for every .
The scout-number conjecture. For , any effective scout protocol on requires at least scouts.
The claim extends the paper's theorem for and, together with the known sufficiency of scouts, would identify the exact minimum number of scouts needed for effective exploration of .
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.