← Questions
Winner of a stack-merging game
0
I was asked this
No reports yet. Sign in to say where you were asked it.
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 official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding
