-- Knight's Path EECS2500: Linear Data Structures Description: In This Project You Will Use A Queue To Determine The Shortest Sequence Of Moves For A Chess Knight To Move From A Starting Square To The Final Square. Details: A Chessboard Is An 8x8 Grid Of Squares With Alternating Colors. For Our Project We Will Number The Rows And Columns From 0 To

again checking for a valid position). The starting position is placed in a queue and the searching begins! Input the starting row and column separated by a space : 0 100 The column must be between 0 and 7. Try again. Input the starting row and column separated by a space : -54 The row must be between 0 and 7. Try again. Input the starting row and column separated by a space : 00 Input the final row and column separated by a space: 66 Computation: The Test and Generate Method: To find the sequence of moves for the knight you will take the first item off of the queue, test it to see if it matches the goal state. If it does match the goal state you are done and the path that knight has traveled is the shortest path to the destination. If it does not match the goal state: generate all valid moves from the current square creating a new object for each of them and add them to the queue. Output: Output from your program should give the