What will I learn?
This puzzle is all about exploring a 2D grid in an optimized way. You may implement BFS and a pathfinding algorithm such as A* to find the shortest path between two tiles.
External resources
Breadth First SearchTwo dimensional arrayPathfindingA*Learning Opportunities
This puzzle can be solved using the following concepts. Practice using these concepts and improve your skills.
Statement
The goal of this puzzle is to explore a map with a fog-of-war until you have found a point of interest and the best path to get back. Take all the time you need on exploration (Breadth First Search) because you will need to be certain to have the shortest path to get back to the entrance from the point of interest (Pathfinding).
A higher resolution is required to access the IDE
Story
Rick just got out of the spaceship and has to join the control room of the base, lost deep down in a labyrinth full of corridors and dead ends. You will have to help the Captain find his way out of this, but beware: the clock is running. Tick Tock.