Shortest Path algorithm of a different kind
- by Ram Bhat
Hey guys,
Lets say you have a grid like this (made randomly)
Now lets say you have a car starting randomly from one of the while boxes, what would be the shortest path to go through each one of the white boxes? you can visit each white box as many times as you want and cant Jump over the black boxes. The black boxes are like walls. In simple words you can move from white box to white box only..
You can move in any direction, even diagonally.
