# 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. https://jair.org/index.php/jair/article/view/11073

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.

https://jair.org/index.php/jair/article/view/11073

====

DANG IT, the guy who found in 2017 in detail what I sketched out in 2013 for “short-enough path finding” (traveling salesman, anypath class (did he see my Vine? ) – works for the DoD in Australia in figuring out more accurate ways to SHOOT THINGS.

Now I’m really glad I didn’t join the US Navy, not that it was anything but a 400ms thought I had once at 15 and quickly dismissed. .

https://www.dst.defence.gov.au/publication/new-paths-sensor-shooter-how-digitization-can-change-formability-and-topology
=====