PROBLEM STATEMENT

Gagannaut Anand wants to go to moon in a Chandravahan. But Chandravahan object destroyer beam is damaged so the harmful objects need to be avoided at all costs to keep Gagannaut Anand safe and India's hopes of a brightfuture alive. You are working in the Control and Operational team of ISRO which regulates Satellite's launch, re-orbiting, disposal, etc. You need to perform certain checks to make Chandravahan decipher the shortest possible path between two satellites and to avoid any possible orbital.

SOLUTION

This Unity project uses Breadth First Search algorithm to find the shortest path between 2 satellites. BFS is an algorithm to find the shortest path between two points.

HOW TO USE

Set the transform of START and END point on the script attached to the Node gameobject and press play button. The first Satellite will spawn at the starting point and move towards the end point, through the path generated by the BFS algorithm.

TOOL USED

Unity game engine

Goto Builds and click on the .exe file to play the game.