Celestials is an AI based game designed to solve the famous travelling salesman problem. The problem is modelled in forms of planets, and the UFO should find the shortest optimal route to traverse all the planets without going through any of them more than once.
- The user determines the number of planets that the UFO has to traverse.
- The default population size is 50 with a mutation rate of 1%.
- Five best agents from each population are chosen to reproduce.
Python version used: 3.6
Input:
Searching:
Solution found:
