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 *please do not give me code answer or programing is wrong answer if you dont know do not answer?
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 *please do not give me code answer or programing is wrong answer if you dont know do not answer?
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
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
*please do not give me code answer or programing is wrong answer if you dont know do not answer?
![1 2 3
4
5
6 7 8 9 10
1
2
4
5
1
6.
2
7
3
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](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fb7a60d0e-672d-45c0-89a2-069077b3ef16%2Fc2b828f4-10aa-4668-b835-49fbbbde3515%2Fj7b7fvq_processed.jpeg&w=3840&q=75)
Transcribed Image Text:1 2 3
4
5
6 7 8 9 10
1
2
4
5
1
6.
2
7
3
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
![start
end (-1)
151909
1,5
0,8
174559
1,7
5,8
174826
184336
184506
184515
184636
184678
184027
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
1741 24
O5,](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fb7a60d0e-672d-45c0-89a2-069077b3ef16%2Fc2b828f4-10aa-4668-b835-49fbbbde3515%2F9a2kpyo_processed.jpeg&w=3840&q=75)
Transcribed Image Text:start
end (-1)
151909
1,5
0,8
174559
1,7
5,8
174826
184336
184506
184515
184636
184678
184027
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
1741 24
O5,
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