At a student\'s engineering convention the robotics challenge was provided by pr

Question

At a student's engineering convention the robotics challenge was provided by professor JB to build a smart algorithm for a car that can travel through to 12 rooms using the "knight's tour". The problem of finding the knight's tour around a chessboard is a sequence of moves made by a knight chess piece that visits each square on the board exactly once. In each move, the knight moves 2 squares horizontally then one vertically, or 2 squares vertically then 1 horizontally. (in a chess game, its move cannot be blocked by another piece) The eight squares that a knight may reach in a single move from a particular square S are Marked K in the figure below. An example of a 5x5 board would look as such Of course if the knight piece starts at an edge, there may be fewer than eight reachable squares In this problem, you will attempt to produce an FSM model for knight's tour machine that can travel a 4 by 3 board. Find or develop 1- An FSM model to describe a travel algorithm to cover all the squares (in our case it is the number of rooms in the puzzle). You can only visit a room once. The judge will shut the door to a room that has already been visited shortest amount of time robot car to visit all the rooms using this walk. 2- Derive a C structure for this model that you think can solve the puzzle in the 3- Extra credit: Program this algorithm to show the number of iterations it took for the For Example: the optimal solution for the 3x4 is 12 moves. I looks as such 14710 811 2 5 3 6 9 12 The lines in this case are travelling lanes for the robot car

Explanation / Answer

}

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.