Pathfinding visualizations with Python and Pygame

Conflict-based search for multi-agent path finding

The collection of Context-Free Path Querying algorithms

Visualization tool for the most popular pathfinding and maze generation algorithms.

🧠 This repository features an intelligent agent that autonomously explores the Wumpus World—a grid filled with hidden Wumpuses, pits, and gold. Using logic, inference, and planning, the agent avoids dangers, finds gold, and escapes. Includes real-time Pygame visualization and customizable settings, ideal for AI/game logic study and experimentation

A Visualizer for pathfinding algorithms (including A*, Dijkstra, BFS, DFS) and sorting algorithms (including Merge, Quick, Insertion, Bubble, and selection sort)

Pathfinding algorithms visualizer written in Python using PyGame

A visualizer for various path finding algorithms on 3 different grid sizes, with custom maze building feature, made with pure python and pygame.

Explore a map to find a path from start to goal

This project implements the dijkstra, A* and D* Lite algorithms and compares them.

Generates GIF animation visualizing the outcome of some prominent AI algorithms that don’t use machine learning techniques. (Dijkstra, A*, Held-Karp, Evolution, Production rule system)

This repository contains the development of an exciting First-Person Shooter (FPS) game project where I've implemented smart NPC (Non-Player Character) behaviors to enhance the gaming experience.

Shortest path using A* and Theta* algorithms

A visual pathfinding program that allows the user to create their own obstacles or mazes and then run different pathfinding algorithms on it.

Pygame program which visualises different path finding algorithms

Pathfinding Algorithm Visualizer built using Pygame. Graphical visualizations of breadth first search (BFS), dijkstra and A* search algorithm done

A visualiser that shows how different *pathfinding algorithms* find a path.

This project is a graphical maze game implemented using Python and Tkinter. It allows users to generate random mazes. It features multiple pathfinding algorithms, including Depth-First Search (DFS), Breadth-First Search (BFS), Dijkstra's Algorithm, and the A* Algorithm

ST1507 Data Structures and Algorithms Assignment 2

Pacman using object-oriented python programming, with unique path-finding algorithms and behaviour patterns coded into individual agents. Easily extensible to multiple maps, players, enemies etc.