Kinoco Hacker Hands-on security practice
All challenges In progress
Programming Level 3 90 points

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.

#programming#python#bfs#algorithms

Clear it in 3 steps

Not started

  1. Start the environment

  2. Investigate the target

    Available after the environment starts

  3. Submit the flag