Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Write a program which performs a breadth-first search to find the solution to any given board position for 15 puzzle Input The input should be given in the form of a 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 Example >1024573896 11 12 13 10 14 15 Moves: RDLDDRR Number of Nodes expanded: 361 Time Taken: 0.238 Memory Used: 704kb Hint • You can use hashset to keep track of explored nodes and fast lookup

Write a program which performs a breadth-first search to find the solution to any given board position for 15 puzzle Input The input should be given in the form of a 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 Example >1024573896 11 12 13 10 14 15 Moves: RDLDDRR Number of Nodes expanded: 361 Time Taken: 0.238 Memory Used: 704kb Hint • You can use hashset to keep track of explored nodes and fast lookup

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question

Use Python. Pseducode code is given. The input is in the example part and the expected output should be like the  example.

Write a program which performs a breadth-first search to find the solution to any given board position for 15 puzzle Input The input should be given in the form of a 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 Example > 1024573 896 11 12 13 10 14 15 Moves: RDLDDRR Number of Nodes expanded: 361 Time Taken: 0.238 Memory Used: 704kb Hint You can use hashset to keep track of explored nodes and fast lookup
Transcribed Image Text:Write a program which performs a breadth-first search to find the solution to any given board position for 15 puzzle Input The input should be given in the form of a 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 Example > 1024573 896 11 12 13 10 14 15 Moves: RDLDDRR Number of Nodes expanded: 361 Time Taken: 0.238 Memory Used: 704kb Hint You can use hashset to keep track of explored nodes and fast lookup
Figure 3.9 function BREADTH-FIRST-SEARCH(problem) node + NODE(problem.INITIAL) if problem.IS-GOAL(node.STATE) frontiera FIFO queue, with node as an element reached{problem. INITIAL} then return node while not IS-EMPTY(frontier) do node POP(frontier) for each child in EXPAND(problem, node) do s+child.STATE returns a solution node or failure if problem.IS-GOAL(s) then return child if s is not in reached then add s to reached add child to frontier return failure function UNIFORM-COST-SEARCH(problem) returns a solution node, or failure return BEST-FIRST-SEARCH(problem, PATH-COST)
Transcribed Image Text:Figure 3.9 function BREADTH-FIRST-SEARCH(problem) node + NODE(problem.INITIAL) if problem.IS-GOAL(node.STATE) frontiera FIFO queue, with node as an element reached{problem. INITIAL} then return node while not IS-EMPTY(frontier) do node POP(frontier) for each child in EXPAND(problem, node) do s+child.STATE returns a solution node or failure if problem.IS-GOAL(s) then return child if s is not in reached then add s to reached add child to frontier return failure function UNIFORM-COST-SEARCH(problem) returns a solution node, or failure return BEST-FIRST-SEARCH(problem, PATH-COST)
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 6 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Merge Sort
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS