Winner of a stack-merging game
Two players take turns merging stacks according to the game's rules until no move is left. Given the starting stacks, decide which player wins if both play optimally. Start with a recursive search over game states, then add memoization and discuss the state space.
No answer yet. Write the first one; the best answer gets endorsed.
