A visualizer for the core search algorithms used in AI and game development. Special thanks to Amit Patel and his cool tutorials for providing me with the inspiration. #MadeWithUnity

A* search algorithm in TypeScript

Collection of classes and functions to allow 2D/3D path generation with heuristic algorithms such as A*, Theta* and LazyTheta* and ROS Interfaces

Dijkstra's Shortest Path for 6, 18, and 26-Connected 3D (Volumetric) Image Volumes

CSE 571 Artificial Intelligence

🔍 A friendly visualizer for some search algorithms like DFS, BFS, Greedy and A*

Automatic maze generator (DFS) and maze solver (A*, DFS, BFS) in python.

Code of the ITSC2023 paper: "Efficient Path Planning in Large Unknown Environments with Switchable System Models for Automated Vehicles". Author: Oliver Schumann

A grid geometry toolkit for A* pathfinding and 2D sprite motion.

collection of motion planning algorithms

Simple graph classes

this project combines various AI algorithms to provide visualization and functionality for search algorithms, a game (CONNECT4) using min-max algorithms, and a Constraint Satisfaction Problem (CSP) solver. This toolbox aims to provide a comprehensive understanding of these AI techniques through interactive visualizations and practical examples.

A simple fastest route finder written in Java includes BFS, Djikstra(Speed limits included) and A* Algortihms also has the feature of visualization of visited nodes.

It's an implimetetion a Pathfinding Algorithm with multiple agents

Romania Problem with A* Algorithm - AI Class Homework

Eight Puzzle solver using BFS, DFS & A* search algorithms

Desktop app for visualizing graph search algorithms

This project consists of implementations of several kNN algorithms for road networks (aka finding nearest points of interest) and the experimental framework to compare them from a research paper published in PVLDB 2016. You can use it to add new methods and/or queries or reproduce our experimental results.

A C++ implementation of N Puzzle problem using A Star Search with heuristics of Manhattan Distance, Hamming Distance & Linear Conflicts

CIT-316 (Artificial Intelligence Sessional)