In  the below figure we have a 11*11 board. The rows and columns are numbered from 0 to 10. The picture shows the way to calculate the next move in the board. The yellow square (5,6) is the example start position and 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 an order (up 1 move, right 2 move, down 2 move, left 1 move), You should keep repeating the move upto the point you reach to the goal by using Breadth FirstSearch 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 colums you will see ex: +5 which means you will add your student number’s last digit to 5. Example is provided for each rule. Apply the rule for your student number by looking at the table Your solution should have the follwing information. Papers with missing name, stno, start and end point won’t be graded

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 a 11*11 board. The rows and columns are numbered from 0 to 10. The picture shows the way to calculate the next move in the board. The yellow square (5,6) is the example start position and 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 an order (up 1 move, right 2 move, down 2 move, left 1 move), You should keep repeating the move upto the point you reach to the goal by using Breadth FirstSearch 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 colums you will see ex: +5 which means you will add your student number’s last digit to 5. Example is provided for each rule. Apply the rule for your student number by looking at the table
Your solution should have the follwing information. Papers with missing name, stno, start and end point won’t be graded
                                              YOUR SOLUTION
Your Name:
Your Student Number:174069
Start Point:
End Point :
Apply Breadth First to find the solutoion to your problem. 
a) Create a state space as by the provided movement rules at the begining 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 blured and should be placed horzatal so that i can see it without rotating). Otherwise you can also use computer for drawing?
b) Write the path and tell in how many steps you reach to the solution?

*Note that this subject is artificial intelligence do not give answer with code or programing????

 

 

Table for Problem 1
Student no
150961
164581
Start
End(+4)
1,5
6,5
1,6
8,5
170993
172084
172792
174080
174100
174341
174492
174563
174792
174820
180042
183001
183021
183022
183401
184085
184101
184121
184222
184230
184281
184300
184310
184443
184452
184472
184490
184562
184601
184650
184710
184763
184882
start
End (-5)
140306
1,4
0,5
154168
1,5
6,3
164315
164438
172037
174119
174216
174218
176106
176107
176139
184119
Transcribed Image Text:Table for Problem 1 Student no 150961 164581 Start End(+4) 1,5 6,5 1,6 8,5 170993 172084 172792 174080 174100 174341 174492 174563 174792 174820 180042 183001 183021 183022 183401 184085 184101 184121 184222 184230 184281 184300 184310 184443 184452 184472 184490 184562 184601 184650 184710 184763 184882 start End (-5) 140306 1,4 0,5 154168 1,5 6,3 164315 164438 172037 174119 174216 174218 176106 176107 176139 184119
Problem 1: In the below figure we have a 11*11 board. The rows and columns are numbered
from 0 to 10. The picture shows the way to calculate the next move in the board. The yellow
square (5,6) is the example start position and 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 an order (up 1 move,
right 2 move, down 2 move, left 1 move), You should keep repeating the move upto the point
you reach to the goal by using Breadth First Search algorithm.
0 1 2 3 4 5 6 7 8 9 10
1
2
3
4
6.
4
2
7
9
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
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 colums you will see ex: +5 which means you will add your student number's last digit
to 5. Example is provided for each rule. Apply the rule for your student number by looking at
the table
Your solution should have the follwing information. Papers with missing name, stno, start
and end point won't be graded
YOUR SOLUTION
Your Name:
Your Student Number:
Start Point:
End Point :
Apply Breadth First to find the solutoion to your problem.
a) Create a state space as by the provided movement rules at the begining 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 blured and should be placed horzatal so that i can see it without rotating).
Otherwise you can also use computer for drawing (40 points)
b) Write the path and tell in how many steps you reach to the solution (25 points)
Transcribed Image Text:Problem 1: In the below figure we have a 11*11 board. The rows and columns are numbered from 0 to 10. The picture shows the way to calculate the next move in the board. The yellow square (5,6) is the example start position and 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 an order (up 1 move, right 2 move, down 2 move, left 1 move), You should keep repeating the move upto the point you reach to the goal by using Breadth First Search algorithm. 0 1 2 3 4 5 6 7 8 9 10 1 2 3 4 6. 4 2 7 9 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 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 colums you will see ex: +5 which means you will add your student number's last digit to 5. Example is provided for each rule. Apply the rule for your student number by looking at the table Your solution should have the follwing information. Papers with missing name, stno, start and end point won't be graded YOUR SOLUTION Your Name: Your Student Number: Start Point: End Point : Apply Breadth First to find the solutoion to your problem. a) Create a state space as by the provided movement rules at the begining 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 blured and should be placed horzatal so that i can see it without rotating). Otherwise you can also use computer for drawing (40 points) b) Write the path and tell in how many steps you reach to the solution (25 points)
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Intelligent Machines
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
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