Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 7907613
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 3, 20262026-06-03T11:31:56+00:00 2026-06-03T11:31:56+00:00

Can somebody explain about Iterative Deepening A* ? I still don’t understand how it

  • 0

Can somebody explain about Iterative Deepening A*? I still don’t understand how it works.
Iterative deepening search w/ Depth First Search, and If still not found the solution; increase the Depth++ until found solution.

If Iterative deepening using Depth, then Iterative Deepening A* use what to limit their search?

Here are a picture if you need to explain how it IDA* Works, i just don’t understand how it works.

(1,2,4,9) and etc, is the step

0+2=2 is f(n)=g(n)+h(n)

IDA* EXAMPLE

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-03T11:32:03+00:00Added an answer on June 3, 2026 at 11:32 am

    If Iterative deepening using Depth, then Iterative Deepening A* use what to limit their search?

    The naive implementation of IDA* would just have something like threshold++ at the end of every iteration, similar to your depth++ above. This is to keep IDA* admissible.

    A better algorithm (that still keeps IDA* admissible) would be to increase the threshold by the next smallest g() cost that is available (from the closed set to the open set).

    See: http://webdocs.cs.ualberta.ca/~jonathan/PREVIOUS/Courses/657/Notes/10.Single-agentSearch.pdf

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Can somebody explain to me why classes are not first class objects in Java?
Can somebody explain to me why the following works: template<class T> class MyTemplateClass {
Can somebody explain why the following code is not valid? Is it because the
can somebody explain me about redefinition in C: is it possible to do something
Can somebody explain in a simple manner about what exactly happens with http and
I'm a little bit confused about these two terms, can somebody explain what is
Can somebody explain to me why this works (in Python 2.5) : class Foo(object):
I read about 'side effect' from this website : but still not understand why
I do not know where my head is today, can somebody please explain to
I have some question about the following switch in Linux Kernel, somebody can explain

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.