The k=10k=10 fixed-distance maze nonsolvability conjecture

About 8 years old · traced to

Let M10⊆M\mathcal{M}_{10}\subseteq\mathcal{M} be the class of mazes whose destination is at distance 1010 from the origin. The k=10k=10 conjecture. Conjecture that there exists a kk for which Mk\mathcal{M}_k is not solvable holds for k=10k=10; equivalently, M10\mathcal{M}_{10} 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.