This Treasure-Map application will find the "treasure", which is the shortest path to the furthest point given a start location, a base image and a maze image. It will first draw the entire maze on a copy of the base image inside the low order bits so that each pixel differs by very little from its original value with this encoding, which cannot be seen with our eyes. And a decoder is able to draw the shortest path from the start to the furthest point using a modified BFS algorithm. It also provides the option to render the maze on the base image with a grey colour.
richard-zh-yang / treasure-map Goto Github PK
View Code? Open in Web Editor NEWFind the shortest path from the start to the furthest point on the maze applying a modified BFS algorithm