Grixti's Lab
AI Travelling Salesman Problem (Part 1)
Example #1
with 4 cities (24 possible paths).
*H = Home (back to first city in sequence).