Write a program which performs Iterative Deepening a-star (IDA*) search to find the solution to anygiven board position for 15 puzzle using two types of heuristics:1. Number of misplaced tiles2. Manhattan Distancehttps://en.wikipedia.org/wiki/Iterative_deepening_A*Described in section 3.5.5 of the textbook.InputThe input should be given in form of sequence of numbered tiles for initial board configuration,'0' indicating the empty space (see example below)Output1. Moves2. Number of Nodes expanded3. Time Taken4. Memory UsedSubmissionPlease upload the code to gradescope. The starter code written in python is helpful forcompatibility with gradescope autograder.Source CodeReadme.txt including instruction to run the code, include version of compiler you areusing (e.g. java 1.8, c++11)

Algorithm: Initialize the search agent and provide it with an initial state of the puzzle and a…

Answered: Write a program which performs…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

Write a program which performs Iterative Deepening a-star (IDA*) search to find the solution to any
given board position for 15 puzzle using two types of heuristics:
1. Number of misplaced tiles
2. Manhattan Distance
https://en.wikipedia.org/wiki/Iterative_deepening_A*
Described in section 3.5.5 of the textbook.
Input
The input should be given in form of sequence of numbered tiles for initial board configuration,
'0' indicating the empty space (see example below)
Output
1. Moves
2. Number of Nodes expanded
3. Time Taken
4. Memory Used
Submission
Please upload the code to gradescope. The starter code written in python is helpful for
compatibility with gradescope autograder.
Source Code
Readme.txt including instruction to run the code, include version of compiler you are
using (e.g. java 1.8, c++11)

Expert Solution

Step 1

Algorithm:

Initialize the search agent and provide it with an initial state of the puzzle and a chosen heuristic function (either the Manhattan distance or the misplaced tiles).
The initial state is represented as a list of 16 numbers, where '0' represents the empty tile.
The search agent creates a priority queue, which is initialized with the initial state of the puzzle and an empty path.
The search agent also creates an empty set to keep track of the states that have already been explored.
While the priority queue is not empty, the search agent dequeues the state with the highest priority (i.e., the state with the lowest heuristic value) and its corresponding path.
If the dequeued state is the goal state (i.e., all tiles are in their correct position), the search agent returns the path to reach that state, and the number of nodes expanded during the search.
If the dequeued state is not the goal state, the search agent generates all possible successor states by moving the empty tile in all possible directions (left, right, up, and down).
For each successor state, the search agent calculates the heuristic value using the chosen heuristic function and adds the state, its path, and its heuristic value to the priority queue.
The search agent also adds the dequeued state to the set of explored states.
The search agent repeats steps 5-9 until the goal state is found or the priority queue is empty (i.e., all possible states have been explored).
The search agent returns the path to the goal state and the number of nodes expanded during the search.
The main function calls the solve method with the initial state and the chosen heuristic function, prints the moves needed to solve the puzzle, and returns the path to the goal state.