- #1
gruba
- 206
- 1
Homework Statement
On how many ways the king can be moved from the bottom left field to the upper right field on the chess board such that such that for every move it is closer to the upper right field?
Homework Equations
-Combinatorics
The Attempt at a Solution
I assume it is diagonal path of [itex]8\times 8[/itex] matrix.
Is there some strict method in combinatorics (exclusion-inclusion, generating functions,...) to prove this?