Skip to content

Latest commit

 

History

History
5 lines (4 loc) · 308 Bytes

File metadata and controls

5 lines (4 loc) · 308 Bytes

SimpleAI Traveling Salesman Problem Solution

By Aaron Hung

Purpose

This is a solution for the traveling salesman problem using the Python SimpleAI framework. This solution uses state space search with the local search hill climbing algorithm to find an optimal path given a set number of restarts.