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.  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  rollnumber 174069 table for problem 1                  Student no           Start               End(+4) 150961                     1,5                           6,5 164581                    1,6                            8,5 170993

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...
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 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 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 

rollnumber 174069

table for problem 1

         

 


     Student no           Start               End(+4)

150961                     1,5                           6,5

164581                    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
 
 

 
  student no             start                          End(-5)

140306                  1,4                                      0,5

154168                 1,5                                      6,3

164315
 
 

164438
 
 

172037
 
 

174119
 
 

174216
 
 

174218
 
 

176106
 
 

176107
 
 

176139
 
 

184119
 
 

184238
 
 

184258
 
 

184318
 
 

184407
 
 

184408
 
 

184428
 
 

184716
 
 

184837
 
 

184009
 
 

 
student no          start                  end (-1)

151909               1,5                           0,8

174559                 1,7                          5,8

174826
 
 

184336
 
 

184506
 
 

184515
 
 

184636
 
 

184678
 
 

184027
 
 

 
 student no    Start         End as it is
150030         1,5                  3,0

154152         1,5                   5,2

154385
 
 

164421
 
 

164449
 
 

164527
 
 

164568
 
 

164602
 
 

164649
 
 

164688
 
 

170088
 
 

170089
 
 

170995
 
 

170996
 
 

170998
 
 

173032
 
 

174031
 
 

174069
 
 

174124
 
 

174152
 
 

174199
 
 

174394
 
 

174411
 
 

174528
 
 

174601
 
 

174612
 
 

174758
 
 

180055
 
 

184024
 
 

184032
 
 

184123
 
 

184124
 
 

184154
 
 

184187
 
 

184235
 
 

184276
 
 

184329
 
 

184333
 
 

184396
 
 

184397
 
 

184459
 
 

184476
 
 

184479
 
 

184598
 
 

184634
 
 

184647
 
 

184656
 
 

184679
 
 

184687
 
 

184725
 
 

184776
 
 

184799
 
 

184859
 
 

184865
 
 

186076
 
 

193027
 
 

194054
 
 

194498
 
 

194588
 
 

20340001
 
 

124259
 
 

136094
 
 

   

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
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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…
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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY