Hello, World!
The Pixels are robots!
Impressive right?
They come from the green tiles.
And go to the red tiles.
The color is customizable per character.
The algorithm is based on Dijsktra
Even though the grid is 2D, we work in 3D.
As you probably guessed, the 3rd axis is time.
The complexity is O(n*n) with n the length of the longest path.
The algorithm becomes VERY expensive for large grids.
Adding more sources and sinks can reduce the search area.
THE END.
Thanks for watching !
