We consider the following initial state (left) and goal state (right) for the 8-puzzle problem: 5 - 1 8 4 7 2 6 3 1 2 3 8 - 4 7 6 5 What are the heuristic function values between these two states for the following two heuristic functions? • Total Manhattan distance: • Total number of out-of-space tiles:
Added by Mark D.
Close
Step 1
Total Manhattan distance: The Manhattan distance is the sum of the horizontal and vertical distances between two tiles. To calculate the Manhattan distance between the initial state and the goal state, we need to count the number of moves required to move each Show more…
Show all steps
Your feedback will help us improve your experience
Adi S and 69 other Calculus 3 educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Akash M.
Problem 4 For the below network; it is desired to determine the shortest rout between cities 1 to 7. Define the stages and the states using backward recursion and then solve the problem
Sri K.
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD