Problem 1: In the below figure we have a 1111 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...

See similar textbooks

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?