1 3 4 8 6 2 7 5 2 8 1 2 8 1 4 4 3 4 6 3 76 5 7 5 Implement the following search algorithms and test them on the start sta state shown above. Only A* needs to detect duplicate states and eliminate the remainder of the search.
1 3 4 8 6 2 7 5 2 8 1 2 8 1 4 4 3 4 6 3 76 5 7 5 Implement the following search algorithms and test them on the start sta state shown above. Only A* needs to detect duplicate states and eliminate the remainder of the search.
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...
Related questions
Question
![Artificial Intelligence programming assignment
Here is the goal state and four start states for the 8-puzzle.
Goal:
Easy:
Medium:
Hard:
Worst:
1 2 3
5 6 7
1 3 4
8 6 2
2 8 1
2 8 1
8
4
4 3
4 6 3
4
8.
76 5
7
7 6 5
7 5
3 2 1
Implement the following search algorithms and test them on the start states and
goal state shown above. Only A* needs to detect duplicate states and eliminate them
from the remainder of the search.
1. A* search using the heuristic function f*(n) = g(n) + h*(n), where h*(n) is the number
of tiles out of place (not counting the blank).
2. A* search using the Manhattan heuristic function.
3. Iterative deepening A* with the Manhattan heuristic function.
4. Depth-first Branch and Bound with the Manhattan heuristic function.
When defining the successor function, it is helpful to define the actions in terms of
the empty tile, that is, the four actions are moving the empty tile right, down, left, and
up. Consider the actions in this order in your implementation.
If your algorithms take too long or too much memory to find any solution, your
implementation may be inefficient. Consider optimizing it. If you still can't find solutions
within a reasonable amount of time, enforce a time limit, say 30 minutes, on your
algorithm and specify it in your report.
Problem Analysis:
For all the algorithms, include in your report a table the number of nodes
expanded, the total time required to solve the puzzle, and the sequence of moves in the
optimal solution. For Depth-first Branch and Bound, also record the time the optimal
solution is found (typically not the same as the finish time).
Deliverables:
1) Well commented code (JAVA).
2) A readme file explaining how to compile and run your code.
3) A written report explaining your experimental results and analysis.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fd754cbd5-de39-4987-bce4-91d829534843%2F073c9255-1f93-4998-9ba6-b2d6162a551b%2Fs39k3x8_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Artificial Intelligence programming assignment
Here is the goal state and four start states for the 8-puzzle.
Goal:
Easy:
Medium:
Hard:
Worst:
1 2 3
5 6 7
1 3 4
8 6 2
2 8 1
2 8 1
8
4
4 3
4 6 3
4
8.
76 5
7
7 6 5
7 5
3 2 1
Implement the following search algorithms and test them on the start states and
goal state shown above. Only A* needs to detect duplicate states and eliminate them
from the remainder of the search.
1. A* search using the heuristic function f*(n) = g(n) + h*(n), where h*(n) is the number
of tiles out of place (not counting the blank).
2. A* search using the Manhattan heuristic function.
3. Iterative deepening A* with the Manhattan heuristic function.
4. Depth-first Branch and Bound with the Manhattan heuristic function.
When defining the successor function, it is helpful to define the actions in terms of
the empty tile, that is, the four actions are moving the empty tile right, down, left, and
up. Consider the actions in this order in your implementation.
If your algorithms take too long or too much memory to find any solution, your
implementation may be inefficient. Consider optimizing it. If you still can't find solutions
within a reasonable amount of time, enforce a time limit, say 30 minutes, on your
algorithm and specify it in your report.
Problem Analysis:
For all the algorithms, include in your report a table the number of nodes
expanded, the total time required to solve the puzzle, and the sequence of moves in the
optimal solution. For Depth-first Branch and Bound, also record the time the optimal
solution is found (typically not the same as the finish time).
Deliverables:
1) Well commented code (JAVA).
2) A readme file explaining how to compile and run your code.
3) A written report explaining your experimental results and analysis.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY