Hard Problemsoptimizationinterval
Optimal Strategy for a Game
Coins of varying values sit in a row. Two players alternate turns, each turn taking either end coin of the remaining row, and both play to maximize their own total. Find the maximum total the first player can guarantee regardless of how the second player plays.
Do this lesson first: house robberThe full breakdown and animated table for this problem are still being written. In the meantime, run the four questions on it yourself — that is the whole exercise.