Sunday 15 July 2012

Knight of chess

A knight of chess is present on A1 square of chessboard. Within 63 steps he moves H8 square of board such that in every move, he goes to a new square thereby covering all the 64 squares of the board. How many ways can he do this?
Posted by at
Labels:

1 comment:

  1. Unknown2 April 2013 at 05:37

    He can never do so within 63 moves.
    Try forming equations of the moves of the knight.

    ReplyDelete

Subscribe to: Post Comments (Atom)