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

Solve scrambled 2x2x2 Rubik’s Cubes in under a second using BFS

CIT-316 (Artificial Intelligence Sessional)

Implemented reinforcement learning algorithms, including Value-Iteration and Q-Learning, for a 2D grid world Markov Decision Process resembling a Pac-man game. Also applied the Mini-Max algorithm and common path-planning techniques such as A*, Dijkstra, and bidirectional search.

A browser game where pathfinding algorithms race against each other!

Solving 8-puzzle problem

A toy project where I play around with automatic solving of rubiks cubes using bidirectional breadth first search

Bidirectional BFS in Golang for fewest-hops paths (i.e. unweighted shortest paths)

a simple robot to hold butter to customer on table

Course by University of California San Diego on Algorithms on Graphs

Smart Vacuum Cleaner Agent

Solutions to google foo.bar challenge.

Porjects for Algorithmic Techniques for Artificial Intelligence

Visualizations of several most popular pathfinding algorithms (Dijkstra's algorithm, A* search etc.)

Maze Project on the subject of Uninformed search in artificial intelligence and expert systems course

Prolog program to find and show step by step Rubiks cube solution.

All solutions to the problems in the "Graph Theory I" study plan on LeetCode.

Implementation of BDS using bfs and dfs

This is a homework about various Uninformed and Informed search algorithms, implemented for solving a simple game. This homework is a part of many projects in a Fundamentals to AI course @ FUM.

🚀 Dive into an interactive Pathfinding Visualizer! 🎯 Explore A*, Dijkstra, BFS, DFS, and more with dynamic visuals. Drag, drop, and design your grid, build mazes, and watch algorithms in action!