AI University Search Algorithms - Genetic & Simulated Annealing
-
Updated
Apr 9, 2021 - Python
AI University Search Algorithms - Genetic & Simulated Annealing
Implementing AI based search algorithms to solve the Robot Navigation problem.
(BFS) Breadth First Search Algorithm to determine degrees of separation between two actors
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.
tictactoe game, play against ai with minimax algo
A simple program that calculates the shortest distance between cities in palestine using either A* search algorithm or a greedy search algorithm
AI Search methods from CAP 4630: Intro to AI
Berkeley Pac-Man 🤤◽◽◽👻 projects 0, 1 & 2 solutions
Compare A*, BFS Search Algorithms Using Python in AI.
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.
A servant robot trying to serve as fast as possible using A* algorithm.
Add a description, image, and links to the ai-search-algorithms topic page so that developers can more easily learn about it.
To associate your repository with the ai-search-algorithms topic, visit your repo's landing page and select "manage topics."