Question: A program that will move the knight around a chessboard. The board is represented by an 8-by-8 double-subscripted array board. Each of the squares is
A program that will move the knight around a chessboard. The board is represented by an 8-by-8 double-subscripted array board. Each of the squares is ini- Chapter 4 Ids from an array that whether the pen is curfloor with its pen up. Chapter 4 Arrays 299 tialized to zero. We describe each of the eight possible moves in terms of both their horizontal and vertical components. For example, a move of type O, consists of moving two squares horizontally to the right and one square vertically upward. Move 2 consists of moving one square horizontally to the left and two squares vertically upward. Horizontal moves to the left and vertical moves upward are indicated with negative numbers. The eight moves may be described by two single-subscripted arrays, horizontal and vertical, as follows: horizotal [0] = 2, horizontal [1] = 1, horizontal [2] = -1, horizontal [3] = -2, horizontal [4] = -2, horizontal [5] = -1, horizontal [6] = 1, horizontal [7] = 2, vertical [0] = -1, vertical [1] = -2, vertical [2] = -2, vertical [3] = -1, vertical [4] = 1, vertical [5] = 2, vertical [6] = 2, vertical [7] = 1. Let the variables currentRow and currentCoIumn indicate the row and column of the knight's current position. To make a move of type moveNumber, where moveNumber is between O and 7, your program uses the statements, currentRow += vertical [ moveNumber ]; currentCoIumn horizontal [ moveNumber ]; Keep a counter that varies from 1 to 64. Record the latest count in each square the knight moves to. Remember to test each potential move to see if the knight has already visited that square, and, of course, test every potential move to make sure that the knight does not land off the chessboard. Write a program to move the knight around the chessboard. After this please develop a accessibility to shape the move. Please do not use define 8!! Please write in C++!! Any help would be greatly appreciated!! Thank you in advance!!
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
