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.
Use MakeCode to build and solve random mazes in Minecraft.
A fun basic Maze solver on: https://mazesolveark.herokuapp.com, Made with A* and dijkstra's algo, Play the game on: https://mazesolveark.herokuapp.com/maze2.html
Maze solving game using agent driven by Q dictionary. Agent must take the most apples and avoid mines.
Genetic algorithm used for solving the maze
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.
We made this micromouse project using arduino, IR sensor and sensor array(5 sensor array), DC Motors and L298N motor driver.
Maze solver and maze drawer using stack and queue interfaces via linked lists
MazeSolver uses stacks/queues to solve the maze and gives us the most efficient of the two.
Pixela Maze : Python script that finds the shortest path through a maze.
Solves mazes using the breathfirst algo. Utilizes javaFX for the GUI and incorporated SetArray and QueueArray.
A collection of maze solving algorithms
Maze solver in python
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.
Path Finder: A Python-based interactive visualization of A* Algorithm to solve a user-generated maze
Add a description, image, and links to the mazesolver topic page so that developers can more easily learn about it.
To associate your repository with the mazesolver topic, visit your repo's landing page and select "manage topics."