BFS, IDS, Greedy & A* applied to the 8-puzzle problem. ⚙️
-
Updated
Jun 1, 2020 - Python
BFS, IDS, Greedy & A* applied to the 8-puzzle problem. ⚙️
Visualization for multiple searching algorithms.
Python program that solves the Missionaries and Cannibals problem, a toy problem in AI, with iterative deepening search.
Desktop app for visualizing graph search algorithms
This project implemented the AI with Minimax Algorithm, Alpha-Beta Pruning and Iterative Deepening algorithms to play Sudo Isolation Game.
Contains the assignment 1,2,3 and 4
A servant robot trying to serve as fast as possible using A* algorithm.
☁️ Simple Sokoban Solver written in Python along with AI logic implementation
Connect4 game implementation and AI with MiniMax, Alpha-Beta Pruning, Iterative Deepening
HCMUS - Artificial Intelligence - Lab01: Search Strategies
FreeCell AI implementing BFS/DFS/A*/Iterative Deepening in Python
An Artificial Intelligence that beats human opponents in the game of Isolation in Python
Eight puzzle solver using iterative deepening
A generic python class that carries out IterativeDeepening
A comprehensive comparision of IDFS and IDA* in solving Rubik's Cube
Python Web Crawler implementing Iterative Deepening Depth Search
🧩 Solver for N-Puzzle & N-Queens using Genetic Algorithms, A*, and more in Python
simple solver for a pocket cube
Kalaha game written in Python, PyQt and C++
Add a description, image, and links to the iterative-deepening-search topic page so that developers can more easily learn about it.
To associate your repository with the iterative-deepening-search topic, visit your repo's landing page and select "manage topics."