Consider a chessboard. For those that might not be familiar with chess, a (classic) chessboard is made out of 64 squares (8 rows and 8 columns).

Suppose that the board is clear of any piece, except for the king, which you place at the lowest left corner (the red square A1). You goal is to move around the king to get to the upper right corner (the red square H8). But there are rules: you are only allowed to move either to the right or up (and hence, never diagonally or to the left or down).

How many different paths are there that satisfy those constraints and travel from A1 to H8?

Bonus : Can you generalize to an \(m \times n\) chessboard?

×

Problem Loading...

Note Loading...

Set Loading...