You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
This is a program to drive a robot through a maze using Depth First Search as it's path-planning algorithm. The program is interfaced with Micromouse simulator for visualizing the maze and the robot in real-time.The concepts of object-oriented programming, inheritance, and dynamic polymorphism were used to develop this project.
Generates a random maze and solves it using recursive backtracking. The maze generation utilizes Depth-First Search (DFS) to carve out passages and create a unique maze layout for each run.
This project is a Java-based maze solver that uses the Depth First Search algorithm to find the shortest path to the destination. The maze solver is built using Java, Java Swing, and AWT technologies.