Sept 27, 2013
That’s when I solved the Traveling Salesman problem. P=NP, “Short enough” path. Saved it to Vine. Elastic Bands and Pins on a Grid, Remove pins to find a binary “short enough” path that CAN be closer given finer granularity but as a CAR HAS CERTAIN LENGTH and and a ROAD a certain width, YOU DON’T have to find “short-EST”.
I saw it in this paper from Aug 19, 2017 by Patrick Chisan Hew in “The Length of Shortest Vertex Paths in Binary Occupancy Grids Compared to Shortest r-Constrained Ones” published in JAIR: The Journal of Artificial Intelligence Research.
I’m not done reading it but it’s AS IF I WROTE IT if I was focused enough to put ideas into proofs, which I’m not.
I’m just glad I wasn’t nuts.