A pawn is placed on the lower RIGHT corner square of a 9 by 9 chessboard. A 'move' involves moving the pawn, where possible, either one square to the right, one square up, or diagonally one square up and to the right. Using these legitimate moves the pawn is to be moved along a path from the lower RIGHT square to the upper LEFT square.
How many such paths are there
This is the same conceptual problem as given by Brian Charlsworth
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.
No explanations have been posted yet. Check back later!