Traveling Salesman Demo
Built with JavaFX/TornadoFX and Kotlin
I found this problem interesting due to its simple objective, and yet astronomically large permutations (60 cities = more tour combinations than there are atoms in the universe) that must be pruned and searched through.
- OVERLAP ELIMINATION
- SIMULATED ANNEALING