004.Maze-Runner

• A simple maze game which uses the concept of backtracking (DFS) to generate the maze.
• Initially the starting cell is marked as visited.
• If the current cell has any neighbours which have not been visited, then randomly selected neighbour is marked as visited and made as the current cell.
• If the current cell has no unvisited neighbours,then the current cell is backtracked to the previous cell.
• The process continues until all cells have been visited. Refer to Maze Generation Algorithm
• Who knows the maze better,in maze runner?
  Close this box and try typing his name.