king in 8x8 chessboard (IV Soros Olympiad 1997-98 Correspondence 11.4)
Source:
June 1, 2024
combinatoricscombinatorial geometry
Problem Statement
In the lower left corner of the chessboard there is a king. He can move one cell either to the right, or up, or diagonally - to the right and up. How many ways can the king go to the upper right corner of the board if his route does not contain cells located on opposite sides of the diagonal going from the lower left to the upper right corner of the board?