Problem

Source: 2008 Cuba Mo 1.1

Tags: combinatorics



Juan and Pedro play alternately on the given grid. Each one in turn traces $1$ to $5$ routes different from the ones outlined above, that join $A$ with $B$, moving only to the right and upwards on the grid lines. Juan starts playing. The one who traces a route that passes through $C$ or $D$ loses. Prove that one of them can win regardless of how the other plays.