Tried searching for various keywords and didn't see anything like this one. Fairly simple, but it's also fairly easy to tie yourself into knots trying to go down a wrong path, so I figured I'd post this one:
100 Cards with various visible values are laid out in a single file line. Two players will alternate. Each will be able to see all remaining cards during each turn, and must choose to pick up the card from either end. So the first player can pick the 1st or 100th, the second will be left to pick either the 2nd or 100th, or 1st or 99th, and so on. After each player has taken 50 cards (no passing, so the second player must pick up the last card, even if it is negative), the player with more total points (simply the sum of their cards' values) wins. In the case of a tie, the player who picked first wins.
How should the player going first assure victory?
---
Other quick ones:
You have 6 cards, showing "2", "3", "4", "5", "+", and "=". Use all 6 cards exactly once (face up, properly oriented, etc.) to make a true mathematical statement.
You are given 99 coins that are heads up, and an unknown number of coins that are tails up. You are blindfolded and somehow can't feel the difference between the heads and tails sides of the coins. You can count the coins, put them in arbitrary many piles, flip whichever coins you want, but remember, when you flip and when you sort, you DO NOT know which ones are heads up, which are tails up. In the end, you must end up with just two piles, each containing an equal number of heads. How do you do this?
