What was already known
The single-pair rectangle case is a Hamiltonian path problem solved by Itai, Papadimitriou and Szwarcfiter. Adcock and collaborators proved NP-completeness with an unbounded number of pairs. This work gives the two-pair full-cover case with terminals anywhere in a rectangle.
AI involvement
Zzyzek supplied the task and guidance and credits Claude Opus 5.5 with nearly all project work, including the mathematical argument, manuscript, implementations and formal proof.
- Two-Colour Zig-Zag Numberlink on Rectangles: A Forbidden-Pattern Characterization, a Constructive Polynomial-Time Algorithm, and a Lean VerificationTwo-Colour Zig-Zag Numberlink on Rectangles: A Forbidden-Pattern Characterization, a Constructive Polynomial-Time Algorithm, and a Lean Verification
Importance
A characterization and constructive polynomial-time algorithm settle the arbitrary-terminal two-pair problem for rectangles.
Technical verification
The pinned Lean package reports kernel checking of the obstruction test, the timed decision procedure, the sound and complete timed construction, and the finite case certificates.
Formal checking
The pinned Lean package reports kernel checking of the obstruction test, the timed decision procedure, the sound and complete timed construction, and the finite case certificates.
- Checker
- Z. Zzyzek, reporting Lean 4 verification
- Scope
- ZZN.T.solvableBT_main, ZZN.T.fires3T_iff_solvable, ZZN.T.solveZZNT_main, and the finite slice and window certificates at the cited commit
- Basis
- Reported by the linked checker
- Lean proof, timed algorithms and certificate checksLean proof, timed algorithms and certificate checks
Human understanding
The project explains the algorithm and proof in material attributed to Claude. A human explanation of the central reasoning is undocumented.
Correction and publication history
Historical curation based on the cited claim, AI attribution and checking scope.
Read this published revision