Integer ProgrammingThe Cleaning Robot Puzzle: The Shortest Route, Exactly
Part 3's fast route cleans a furnished 20×20 room in 243 commands. The shortest route takes 221, and this part proves nothing shorter exists: parity and whole numbers put back into Part 8's linear program, branch and …