Conflict-based search for multi-agent path finding (MAPF)

This project implements a random maze generator and visualizes the solution using the A* pathfinding algorithm. It generates a maze, saves it as a PNG image, and highlights the path found by A*. The project includes maze generation, pathfinding, and image rendering functionalities, providing an effective way to explore pathfinding in complex mazes.

A* BFS DFS visualization

Visualization for the following algorithms: A* Search, Bredth First Search, Depth First Search, and Greedy-Best First Search. In addition to Recursive and DFS maze generation.

Implementation of various anytime motion planning algorithms

It is an attempt to visualize various path-finding Algorithms.

Explore and visualize various path-finding algorithms with this interactive webpage. Perfect for learning and understanding algorithms like A*, Dijkstra, and more through engaging animations and intuitive controls.

Collection of tools to visualize Path Finding Algorithms

A path-generating algorithm I created for our Research Project in Mathematics. The Path-generating algorithm is also derived from another algorithm and theory which I also have derived myself. Please run the program for a clear demonstration.

An interactive tool which visualizes path finding algorithms on a grid.

Snake game using path finding algorithms to auto play: BFS, DFS, UCS, A*, Greedy, Hill Climbing, IDFS

Create an agent capable of finding its way in a maze.

N Puzzle game solved by BFS, DFS, A*, UCS, IDFS, Greedy

Utilizes A* Search to automate the 15-puzzle-game, a popular game that includes shifting tiles to a sequential configuration