Lockdown -> O(1) traveling salesperson solution. I think constant runtime is technically not polynomial hard... But seriously this is very cool. Glad to see progress in mathematics.