Hahn's nonincreasing-distance conjecture for cop-win graphs
Statement
Let be an undirected cop-win graph, and consider optimal play, meaning that the cop minimizes capture time while the robber maximizes it. Hahn's conjecture. The distance between the cop and robber does not increase in consecutive rounds in optimal play.
This conjecture was posed by Hahn and published in B+13. It was refuted there.
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.