Answer to Question #219691 in C++ for Cat

Question

Chess Game Knight’s travails.

You are required to do the following:

1. Explain how you can ensure that any move do not go off the board.

2. Choosing a search algorithm for finding the shortest path for the knight’s travails.

3. Defend your choice of an appropriate search algorithm to find the best possible

move from the starting square to the ending square.

4. Creating a script for a board game and a knight.

5. Create a diagrammatical tree structure, to illustrate all possible moves of the

knight as children in the tree structure

Hint:

Develop a data structure similar to binary trees. Using a standard 8 X 8 chessboard, show the knight’s movements in a game. As you may know, a knight’s basic move in chess is two forward steps and one sidestep. Facing in any direction and given enough turns, it can move from any square on the board to any other square. 

Answer 1

Dear Cat, your question requires a lot of work, which neither of our experts is ready to perform for free. We advise you to convert it to a fully qualified order and we will try to help you. Please click the link below to proceed: Submit order