Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

You want to reduce the memory used by A*. You come up with the following idea: you keep in the queue only the N best

You want to reduce the memory used by A*. You come up with the following idea: you keep in the queue only the N best nodes (i.e, the nodes with lower costs), for some positive value of N. When the queue is full and a new node has to be stored, the worst node is deleted from the queue and removed from consideration.

  1. If an admissible heuristic is used, will the modified algorithm find the optimal solution? Explain why (or why not). Are there any additional constraints?
  2. If a perfect heuristic is used, i.e. for all n h(n)=h*(n), where h*(n) is the cost of the optimal path from n to goal, will the modified algorithm find the optimal solution? Explain.

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Beginning ASP.NET 4.5 Databases

Authors: Sandeep Chanda, Damien Foggon

3rd Edition

1430243805, 978-1430243809

Students also viewed these Databases questions