Classic n-puzzle problem solver using A* search
-
Updated
Apr 24, 2023 - C
8000
Classic n-puzzle problem solver using A* search
The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?
Add a description, image, and links to the heuristic topic page so that developers can more easily learn about it.
To associate your repository with the heuristic topic, visit your repo's landing page and select "manage topics."