Python codes for A* algo, RBFS algo and IDS algo on 8_PUZZLES problem.
-
Updated
Feb 25, 2020 - Jupyter Notebook
Python codes for A* algo, RBFS algo and IDS algo on 8_PUZZLES problem.
First Assignment in 'Artificial Intelligence' course by Dr. Ram Meshulam at Bar-Ilan University
Deep Search Algorithm Optimizing IDS And DLS, And Universal Heuristic Search Algorithm For Versatile Exploration With Generic Heuristics.
An ids algorithm for solving rush hour game in python
🐍Snake and Foods, Artificial Intelligence course, University of Tehran
🚑Ambulance & Patients, Artificial Intelligence course, University of Tehran
👩💻Artificial Intelligence Course Projects, University of Tehran
In computer science, iterative deepening search or more specifically iterative deepening depth-first search (IDS or IDDFS) is a state space/graph search strategy in which a depth-limited version of depth-first search is run repeatedly with increasing depth limits until the goal is found.
Add a description, image, and links to the ids-search-algo topic page so that developers can more easily learn about it.
To associate your repository with the ids-search-algo topic, visit your repo's landing page and select "manage topics."