A Python-based application demonstrating various search algorithms, namely Depth-First Search (DFS), Breadth-First Search (BFS), and A* Search (Manhattan Distance Heuristic)

Maze Runner is a maze generation and solving tool using the randomized Kruskal's algorithm and the A* algorithm

Welcome to the Maze Runner. this is an excelent algorithm project using Stack data structre.

Maze Runner is based on Travelling Salesman Problem, to minimize the travelling cost to find the best possible solution. The user input maze image of m x n dimension which is converted to a graph, extracting the nodes and making connections which is used to traverse the maze via different algorithms. So, the user can compare different algorithms to get the most efficient path, while generating nodes in a graph. The maze can be a source to find the shortest easy path, from the multiple path that leads to the solution.

A simulator of maze runner by using Repeated Adaptive A* search algorithm

Maze Runner An interactive maze generator and pathfinding visualizer built with vanilla JavaScript, CSS, and HTML. Generate random perfect mazes, navigate manually with arrow keys, or watch the algorithm solve the maze in real-time with stunning visual effects.

Maze runner game using Prim's Algorithms......... you have to find a path from start pt. to end pt. through stars(*) in a 20x40 size MAZE. Implemented in simple console and also with GUI.

No description available

Maze Runner Too, Analysis of Algorithms

Maze generator & Runner using DFS algorithm

Maze Runner Problem Solved using Backtracing Algorithm

The Maze Runner project with 3 Running algorithms

A maze runner game created using Eller's algorithm

Maze Runner with BFS and Randomized Prim's Algorithm for maze the generation

A Simple maze runner game generated using Prim's algorithm

EGO EV3 Maze Runner using left-hand wall-following algorithm.

Project from HyperSkill: Maze Runner with Prim's Algorithm maze generator and DFS escape finding.

Maze Runner is a maze generation and solving tool using the randomized Kruskal's algorithm and the DFS algorithm

maze runner robot project with stacks and xiaomi robot style algorithm

Creating a maze and a runner which traverses the maze. Also implemented a shortest path algorithm.

Maze Runner - Solve mazes with recursive and iterative algorithms, including direction handling, wall detection, and pathfinding.

A maze solver using state space search algorithms for CSCI 264 Project - https://akhilstanis.github.io/maze-runner/

Maze Runner is a maze generation and solving tool using the Depth First Search (DFS) Algorithm in Python

This repository contains all the code of algorithms of maze runner and controls

Maze Runner is a Java-based application designed to solve mazes using advanced pathfinding algorithms. It offers a user-friendly interface that allows users to input custom mazes and visualize the solution path. Maze Runner showcases the power and versatility of algorithmic problem-solving in Java.

A few algorithmic stuff. A* maze runner, a 3D rotating cube and a simple linear regression algorithm from scratch

A 3D Maze Runner Game Based On Three.js With A Self Designing Algorithm

A simple example of a maze runner uising simple table-based q-learning algorithm.

a simple implementation of a maze runner simulation with different search algorithm (wavefront, a-star, djikstra)

Maze Runner game developed on the idea of Depth First Search(one of the graph traversal algorithm)