ABR and BILLU play the following game.
They start out with n dimes on a table and take turns with ABR starting.
In each step a player can take at most n/2 + 1 dimes from the table,
but he has to take at least one. If somebody takes all the dimes on the table
then he wins. For which values of n will ABR have a winning strategy?
They start out with n dimes on a table and take turns with ABR starting.
In each step a player can take at most n/2 + 1 dimes from the table,
but he has to take at least one. If somebody takes all the dimes on the table
then he wins. For which values of n will ABR have a winning strategy?
No comments:
Post a Comment