# Math

posted by .

In chess, a knight can move either two squares horizontally plus one vertically or two squares vertically plus one horizontall.
a) If a knight starts from one corner of a standard 8*8 chessboard, how many different squares could it reach after
i) one move?
ii) two moves?
iii) three moves?

• Math -

From the corner, it could only reach 2 squares in the first move. In the center of the board, it can reach 8 different squares. However, in the second move, you have two different starting points, but they don't have the availability of all eight positions due to the edge of the board. Also, since the problem is phrased as "different squares," you cannot include the square(s) it was previously in.

I would suggest using a chessboard to deal with this problem.

I hope this helps. Thanks for asking.

• Math -

DROP OUT

## Similar Questions

a chess board has 64 squares if pieces occupy 19 squares how many squares are unoccupied?
2. ### math

Imagine a small chess board, 3 x 3. If you place a knight on the top left hand corner, how many different squares can the knight reach in less than 4 moves?
3. ### Algebra

A chess board has 64 squares. If pieces occupy 19 squares, how many squares are unoccupied?
4. ### Math

The squares of a 2×500 chessboard are coloured black and white in the standard alternating pattern. k of the black squares are removed from the board at random. What is the minimum value of k such that the expected number of pieces …
5. ### grid problem (geometry)

The squares of a 2×60 chessboard are coloured black and white in the standard alternating pattern. At random, exactly half of the black squares are removed from the board. The expected number of white squares that have no neighbours …

A crippled rook can move on a chessboard in the following way: from a square, it can move to an adjacent square sharing a common side, and every two consecutive moves must be at right angles (i.e., the rook makes a 90∘ turn at …