Archived

This topic is now archived and is closed to further replies.

Progressive Deepening Search

This topic is 5016 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

Hi ppl, I''ve made a program to find a solution to the 8-puzzle (n-puzzle) using the Progressive Deepening Search algo. I have two versions: -The uninformed search -The informed search (where I use Manhattan Distance, ang the Ring Heuristic) However, I''ve noticed a bug lately.... Everything works fine, BUT, when I try to solve this simple puzzle: Initial Final 0 1 1 3 2 3 0 2 Uninformed: OK Informed Manhattan Distance: OK Informed Ring Heuristic: NOT OK, infinite loop, always on depth==0. I believe this is due to the fact that Initial Ring Heuristic==0. Do you suggest any solution? Is this a popular bug? Note: the Ring heuristic functions OK to other examples where IRH!=0. Thanks Programmers VisualFX

Share this post


Link to post
Share on other sites
Look for where IRH = 0 then
cause IRH to be a constant (>0). hopefully later in the search it ''picks up'' again, worse comes to worse; its still a uniform search.

I''m a noooob in this area so take my post with a "grain of salt"?

Share this post


Link to post
Share on other sites