The fixed-distance maze nonsolvability conjecture
Let be the class of mazes whose destination is at distance from the origin. The conjecture. Conjecture that there exists a for which is not solvable holds for ; equivalently, is not solvable. The paper proposes this as a stronger specific form of the preceding conjecture and gives no resolution.
References
Primary source
Stefan David and Marius Tiba, “Solvability of Mazes by Blind Robots”, arXiv:1804.05439 (2018).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.