Question 85
Let $N\gt 1$. Shuffle $2N$ cards numbered $1$ through $2N$ and place them face up in a row. Alice and Bob alternate taking either end card until none remain, with Alice first. Each sums the numbers taken; the larger sum wins. Does either player have a strategy guaranteeing not to lose?