It creates and visualizes trees and supports various search algorithms such as BFS, DFS, UCS, A*, Best-First Search, IDS, and Backtracking
-
Updated
Sep 29, 2024 - C++
It creates and visualizes trees and supports various search algorithms such as BFS, DFS, UCS, A*, Best-First Search, IDS, and Backtracking
AI agent that solves a card sorting game using search algorithms like BFS, IDS, and A-Star.
8 Puzzle game
Solving 8-puzzle using BFS, IDS, and 3 kinds of A* with minimum number of actions (AI)
"The repository '100 Mini Projects for Prolog' includes small projects for learning and practicing Prolog."
Implementation of artificial intelligence search algorithms for robot movement on the table.
Maze Project on the subject of Uninformed search in artificial intelligence and expert systems course
a robot that carrying butter on the table with using search algorithms
Deep Search Algorithm Optimizing IDS And DLS, And Universal Heuristic Search Algorithm For Versatile Exploration With Generic Heuristics.
sort it game with help of AI and search algorithms | college project
there are some simple projects using artificial intelligence algorithm
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.
A Kotlin project to find a path in a Maze using several search algorithms including A*, IDS, and BFS.
A Kotlin project to find a path in a Maze using several search algorithms including A*, IDS, and BFS.
Add a description, image, and links to the ids-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the ids-algorithm topic, visit your repo's landing page and select "manage topics."