Clear it in 3 steps
Start the environment
Investigate the target
Submit the flag
All challengesIn progress
Algorithms - BFS Shortest Path Through a Maze
Mission
Use BFS to find the shortest path from S to E in data.txt, then submit the UDLR move sequence to challenge.py. A correct path prints the startup-injected FLAG.
Not started
Hints
Hint 1Show
Use a deque and a visited set
Hint 2Show
Store each cell's parent and move character
Hint 3Show
Trace parents backward from E and reverse the moves