Problem 1: In the below figure we have an 11*11 board. The rows and columns are numbered from 0 to 10. The picture shows the way to calculate the next move on the board. The yellow square (5,6) is the example start position and the red square (7,8) is an example goal position, and the blue squares( in an order of expansion) are the possible positions resulting from one move from the start(yellow square). the moves from any point can be in order (up 1 move, right 2 move, down 2 moves, left 1 move), You should keep repeating the move up to the point you reach to the goal by using the Breadth-First Search algorithm.       Assuming the above-explained rules apply, you will solve the problem for your student number. Everybody will use the first 2 digits of their student number as a start point and the corresponding goal point which you will find at the end of the project in the table. In the table In some columns, you will see ex: +5 which means you will add your student number’s last digit to 5. An example is provided for each rule. Apply the rule for yo

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
icon
Related questions
Question

Problem 1: In the below figure we have an 11*11 board. The rows and columns are numbered from 0 to 10. The picture shows the way to calculate the next move on the board. The yellow square (5,6) is the example start position and the red square (7,8) is an example goal position, and the blue squares( in an order of expansion) are the possible positions resulting from one move from the start(yellow square). the moves from any point can be in order (up 1 move, right 2 move, down 2 moves, left 1 move), You should keep repeating the move up to the point you reach to the goal by using the Breadth-First Search algorithm.

 

 

 

Assuming the above-explained rules apply, you will solve the problem for your student number. Everybody will use the first 2 digits of their student number as a start point and the corresponding goal point which you will find at the end of the project in the table. In the table In some columns, you will see ex: +5 which means you will add your student number’s last digit to 5. An example is provided for each rule. Apply the rule for your student number by looking at the table

Your solution should have the following information. Papers with missing names, stno, start and endpoint won’t be graded

                                              YOUR SOLUTION

Your Name: ALI

Your Student Number: 187666

Start Point:

End Point :

Apply Breadth-First to find the solution to your problem.

  1. a) Create a state space as by the provided movement rules at the beginning of the question for your problem ( you can draw it on the page and add the image here but it should be very organized, not blurred, and should be placed horizontally so that I can see it without rotating). Otherwise, you can also use the computer for drawing.
  2. b) Write the path and tell in how many steps you reach to the solution.
5 6 7 8 9 10
1
2
3 4
6.
4
7
10
State Space: The state space for the above example
- (5,6)
(5,5)
(7.6)
(5,8)
(4,6)
(5.4) (7.5) (5,7) (4.5) (7,5) (9,6) (7,8)
Path: (5,6)(7,6)(7,8) it takes 2 steps to reach to the goal for the above example
3.
O - 2 m4n D 00 9 9
Transcribed Image Text:5 6 7 8 9 10 1 2 3 4 6. 4 7 10 State Space: The state space for the above example - (5,6) (5,5) (7.6) (5,8) (4,6) (5.4) (7.5) (5,7) (4.5) (7,5) (9,6) (7,8) Path: (5,6)(7,6)(7,8) it takes 2 steps to reach to the goal for the above example 3. O - 2 m4n D 00 9 9
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Topological 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.
Similar questions
  • SEE MORE QUESTIONS
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