A servant robot trying to serve as fast as possible using A* algorithm.

A multi-algorithm chess game that aims to teach AI concepts through experimentation. Users can select from four algorithms to compete against, as well set the search depth.

Compare A*, BFS Search Algorithms Using Python in AI.

Berkeley Pac-Man 🤤◽◽◽👻 projects 0, 1 & 2 solutions

tictactoe game, play against ai with minimax algo

AI Search methods from CAP 4630: Intro to AI

A simple program that calculates the shortest distance between cities in palestine using either A* search algorithm or a greedy search algorithm

Implementing AI based search algorithms to solve the Robot Navigation problem.

AI University Search Algorithms - Genetic & Simulated Annealing

An AI project that implements uninformed and informed search algorithms. These algorithms are used to solve navigation and traveling salesman problems in the Pacman world.

(BFS) Breadth First Search Algorithm to determine degrees of separation between two actors

The AI Searches repository provides a Jupyter Notebook demonstrating the implementation of various AI search algorithms commonly used in optimization and pathfinding problems. It includes algorithms such as Breadth-First Search (BFS), Depth-First Search (DFS), Uniform Cost Search (UCS), Greedy Best-First Search, and A* Search.