Combinatorics - 3
-
A pawn moves across an N x N chessboard so that in one move it can shift one square to the right, one square upward, or along a diagonal down and left .
-
In how many ways the pawn go through all the squares on the board, visiting each exactly once, and finish its trip on the square to the right of the initial one?
- From Mathematical Circles (Russian Experience)
The answer is 0.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
0 solutions
No explanations have been posted yet. Check back later!