TSP Territory Map

Concept: Every pixel on the map represents the optimal TSP solution when added to the existing set of nodes.

Algorithm: Uses the Held-Karp dynamic programming algorithm for exact solutions and a Quadtree for spatial sampling to avoid calculating TSP for every single pixel.

• Left Click: Add a new node.
• Drag Node: Move an existing node.
• Right Click (Node): Remove a node.

Note: Performance depends on node count. Held-Karp is O(n^2 * 2^n). Recommended for ≤12-14 nodes for real-time performance.