🚗 AI-powered Rush Hour puzzle solver with Pygame GUI. Features BFS, DFS, UCS & A algorithms to solve traffic jam puzzles. Compare AI performance metrics, play manually, or watch automated solutions. Educational tool for learning search algorithms.

In this algorithm, I have written a module which is consist of a couple of main searching algorithm that has been implemented on the 8 puzzle problem as default.

Maze solver using BFS, DFS, Greedy and UCS.

Proyecto Transmilenio para buscar la mejor ruta entre multiples estaciones usando algoritmos de busqueda de Inteligencia Artificial progrmado en Python

Implementation of artificial intelligence search algorithms for robot movement on the table.

First Assignment in 'Artificial Intelligence' course by Dr. Ram Meshulam at Bar-Ilan University

a robot that carrying butter on the table with using search algorithms

This is phase 1 of my AI project. By using different search algorithms ( DFS, BFS, UCS, A*), I tried to make Pacman do better in eating all the nodes and be alive.

In this project I had to compare 3 algorithm's on the bases of there execution time. There are 3 AI algorithm's which were assign to me in these algorithm's two are uninform and one is inform. And the names of the algorithm's are: 1-DFS, 2-UCS, and A*

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

Informed and uniformed search algorithm for 15 puzzle

AI Search methods from CAP 4630: Intro to AI

A basic game in Pac-Man style demonstrating the use of classical AI.

A website made to calculate shortest path using uniform cost search and A* algorithm

Tugas Kecil 3 Strategi Algoritma IF2211 - Shortest Path Problem Solver using UCS and A* Algorithm

Projeto criado para disciplina Inteligência Artificial, Com objetivo de calcular uma rota entre os dois pontos usando os seguintes algoritmos: ○ Busca em Largura ○ Busca em profundidade (podendo ser o limitado) ○ Busca de custo uniforme ○ A*

A visual Maze Solver built with Python and Tkinter that compares multiple AI pathfinding algorithms (DFS, BFS, UCS, A*) side-by-side. It generates random mazes and visualizes the solving process with execution time comparison in microseconds, offering an interactive and educational look into algorithm efficiency.

8 Puzzle game

Pathfinding With UCS and A* algorithm