Coins in a Row
The puzzle
An even number of coins of various values lie in a row. Players alternate, each taking the coin at either end of the remaining row.
Show that the first player can always guarantee at least as much money as the second.
Stuck?
One at a time, smallest first. Open only as many as you need — the whole point of the puzzle is the part you work out yourself.
Hint 1
Number the positions 1 to 2n and split them into odds and evens.
Hint 2
Whichever of those two sets you choose, can your opponent stop you taking the whole of it?
Show the answer Hide the answer
Add up the odd positions and the even positions. Take whichever total is larger, and you can take that entire set.
How to get there
With 2n coins, positions 1..2n split into n odd and n even. Compare the two totals and pick the bigger - say the odds.
Take coin 1. That leaves coins 2..2n, whose two ends are 2 and 2n, both EVEN. So whatever your opponent takes, it is an even position and the row’s ends are odd again on your turn.
You can therefore take only odd coins all game and collect their entire total, which you chose to be at least half. You never need to look at the values again after the first comparison.
The technique worth keeping
Partition the resource into two sets you can keep separate, then take the better one. A parity argument like this gives a guarantee rather than a heuristic, which is what "always" in a game puzzle demands.