Shortest traveling-salesman tours in solid grid graphs
Determine the complexity of a shortest closed walk visiting every vertex of a solid planar grid graph. Vertices are lattice points, all unit-distance edges are included, the graph has no holes, and lengths are measured by its graph distances; repeated vertices are allowed.
Inferred from the community field; finer classification has not been reviewed.
Problem statement
Determine the complexity of a shortest closed walk visiting every vertex of a solid planar grid graph. Vertices are lattice points, all unit-distance edges are included, the graph has no holes, and lengths are measured by its graph distances; repeated vertices are allowed.
Lean 4
No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.
Background
Editorial selection inspected on 9 September 2026. Current research status has not been independently reassessed; consult the original source and subsequent literature.
- [1]The Open Problems Project — Computational geometry: Shortest traveling-salesman tours in solid grid graphs (inspected 2026-09-09) link
Recorded progress
Add yours →Nothing recorded yet. A pointer to a paper the entry is missing counts.
Machine attempts
0 recordedAttempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.
No machine attempts recorded.
Sign in to run an attempt. New accounts start with enough credits for ten.
Discussion
0 notesNotes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.
No notes yet.
Sign in to add a note.