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.
👁🗨🧠 Artificial Intelligence search project implementing IDS, Bidirectional BFS and A*.
A servant robot trying to serve as fast as possible using A* algorithm.
Desktop app for visualizing graph search algorithms
A comprehensive comparision of IDFS and IDA* in solving Rubik's Cube
Simple chess engines based on sunfish
Python Web Crawler implementing Iterative Deepening Depth Search
Three missionaries and three cannibals are on one side of a river, along with a boat that can hold one or two people. Find a way to get everyone to the other side without ever leaving a group of missionaries in one place outnumbered by the cannibals in that place.
An Artificial Intelligence that beats human opponents in the game of Isolation in Python
A python based chess engine
🧩 Solver for N-Puzzle & N-Queens using Genetic Algorithms, A*, and more in Python
This program solves a 2D maze with the help of several search algorithms like BFS, DFS, A* (A-Star) etc.
My code and report of Udacity AI nanodegree project3 Adversarial Game Playing Agent
Iterative deepening search web crawler using python.
Development of an AI intelligent agent that can play connect 4 using minimax alpha-beta pruning and implementing an IDS
☁️ Simple Sokoban Solver written in Python along with AI logic implementation
This program uses AI algorithms to clean up the dirt in a 4x5 grid in an efficient way using a vacuum agent.
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."