# ONE MORE OPTION THAN USUAL DECODED....

**Discrete Mathematics**Level 4

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