Comparison of search algorithms
-
Updated
Jun 7, 2018 - C++
Comparison of search algorithms
Four_In_A_Row problem has been solved using Python Language with the comprehensive implementation of Min-Max Alpha-Beta Pruning Algorithm. The Depth of the search for the algorithm has been customized for a quicker but less accurate response from an AI agent.
Coleção de Atividades da disciplina de Inteligência Artificial
Tic Tac Toe game with AI
Max Connect 4 game in Java that implements an AI opponent who is very difficult to defeat.
classical search algorithms are used in AI | AI course - Fall 2018
Trifit (Try-Fit) is a Turn based Android game between user and computer on a grid board using Artificial Intelligence.
Algorithms Coded in C++ Language.
An N ✕ N Tic Tac Toe game with an AI opponent build with minimax algorithm, α-β pruning, and a heuristic function. The bot looks four moves ahead to pick the next best move.
Rogue-like AI agent for an adaptation of DreamQuest game.
Implement Algorithms For Graph Search (like A*) & Local Search (like hill climbing algorithms) & Genetics
A multi-agent implementation of the game Connect-4 using MCTS, Minimax and Exptimax algorithms.
Visualization for multiple searching algorithms.
Add a description, image, and links to the depth-limit-search topic page so that developers can more easily learn about it.
To associate your repository with the depth-limit-search topic, visit your repo's landing page and select "manage topics."