Drag around the flag and circle, press space to find the shortest path between them. This project uses the Dijkstra algorithm: http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm The precision of the algorithm can be modified to balance between performance-accuracy. If you increase the precision, the algorithm will become faster but it may not be able to go down tight corridors. If you decrease the precision, the algorithm becomes slower
Press space in turbo for the best performance Average time on normal mode ~ 3.5 secs Average time on turbo mode ~ 2.5 secs
