GitHub - Sonawanesoham/MAZE_SOLVER_JAVA: This Java program implements a maze solver using the Depth-First Search (DFS) algorithm. The program takes an input maze represented as a 2D array, where walls are denoted by '1' and paths are denoted by '0'. It starts from the entrance of the maze and explores the paths using DFS until it reaches the exit.

Sonawanesoham / MAZE_SOLVER_JAVA Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

This Java program implements a maze solver using the Depth-First Search (DFS) algorithm. The program takes an input maze represented as a 2D array, where walls are denoted by '1' and paths are denoted by '0'. It starts from the entrance of the maze and explores the paths using DFS until it reaches the exit.