Ask
Login
0
2.4kviews
Write a short note on IDA*
written 7.2 years ago by gravatar for teamques10 teamques10 ★ 70k modified 3.8 years ago by gravatar for pedsangini276 pedsangini276 • 4.8k

Mumbai University > IT > Sem 7 > Intelligent System

Marks: 5M
artificial intelligence
ADD COMMENT EDIT
1 Answer
0
137views
written 7.2 years ago by gravatar for teamques10 teamques10 ★ 70k

Iterative Deepening A* (IDA) eliminates the memory constraints of A by keeping optimally of the solution.

In IDA* each iteration is a depth-first search with a threshold assigned to it. It keeps track of the cost, f(n)=g(n)+h(n), of each node generated. As soon as the cost of newly generated …

Create a free account to keep reading this post.

and 3 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.