Michal Paszkiewicz

Maths | Game theory!

Taken from Mathematics Stack Exchange

Alice and Bob play a game with first N positive numbers. Out of these N integers some K integers are missing. So both decided to play with remaining N−K integers and in this game Alice wants Bob to win the game.

Game is as follow :

In Xth move, a player can choose some numbers out of all the numbers available such that chosen numbers sum upto X. After the move, chosen numbers are placed back on the table. The player who is not able to make a move loses.

Given that both players play optimally and Alice decides who should go first we need to find who should take the first turn so that Bob wins the game.

Value of N

N =

List of numbers



{{num}} + = {{solution.number}}

To ensure that Bob wins, {{getStarter()}} must start!