Artificial Intelligence - IDA* Search & MA* Search
Artificial Intelligence Course in Farzin Academy:
• Artificial Intelligence - Introduction
In this advanced episode from Farzin Academy, we introduce two powerful informed search techniques: IDA* (Iterative Deepening A*) and SMA* (Simplified Memory-Bounded A*). 🚀
✨ IDA* is a hybrid of A* and IDS, using iterative deepening with a cost-based threshold f(n) = g(n) + h(n).
🧠 SMA*, on the other hand, extends A* for memory-limited environments by selectively forgetting high-cost paths.
Using visual step-by-step examples, we demonstrate how these algorithms efficiently search through graphs while optimizing memory and pathfinding performance.
🎓 What You’ll Learn:
What is IDA* and how thresholds evolve
How SMA* handles memory-bounded searches
Comparison with A* and IDS
Evaluation function f(n)
Visual walkthrough of both algorithms on graphs
Perfect for AI students, competitive programmers, and researchers working with search optimization.
👉 Subscribe to Farzin Academy for more deep algorithm insights and visual CS lessons!