Chess With A Twist
Question 1.
Consider a chessboard of dimensions 4xN. What is the value
of N among the following such that, you can start with a knight(horse) at some
square of the board, proceed by valid moves, visit each square exactly once and
can return to the starting point as the 4N+1st square? [Note: If the knight is
at a position as shown figure, a valid knight move would be any square marked
‘X’]
(A) 2
(B) 4
(C) 8
(D) no such N exists
Question 2.
Consider a chessboard of dimensions 4xN. What is the value
of N among the following such that, you can start with a knight(horse) at some
square of the board, proceed by valid moves, and can visit each square exactly
once, with no requirement that we ever return to the starting square?
(A) 2
(B) 4
(C) 8
(D) no such N exists
Question 3.
Find out the minimum number of moves required to move from
the situation in the left to that in the right if the valid moves for bishop,
rook, knight, king and pawn are shown in the gures below respectively.
(A)
9
(B) 18
(C) 16
(D) 8
So, what are you waiting for!! Go ahead & comment your solutions.
