Navigate the space ship to all the planets and gather resources in the shortest distance to save time before timer runs out! Goal of this game is to make students aware of and practice graph search algorithms. This is an interactive implementation of 'Travelling Salesman Problem', where 5 random points( planets) are generated and user's spaceship (starting from one planet) should visit all planets in best possible path, so that the distance traveled is minimum.
Stephen Hawking Can Play This
Code for Good (Sponsored by Intel)
MS Windows, Linux / Unix, Web browser with special plugins or packaged apps
Tools and Technologies:
Unity (any product)