All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Games
Powerful portions (Posted on 2022-02-21) Difficulty: 2 of 5
Randomly generated number N defines the initial quantity of matches (or marbles, tokens, cards etc) on the table.
Assume N< 333
Two players, A & B take turns taking some matches from the pile, provided the quantity taken is an integer power of 2, i.e. 1, 2, 4…
Winner is the player taking the last batch.
Would you prefer to be the 1st player?
What would be your winning strategy?

No Solution Yet Submitted by Ady TZIDON    
Rating: 4.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution Solution Comment 1 of 1
My strategy would be to always leave my opponent with a multiple of 3 objects remaining. All powers of 2 are either 1 mod 3 or 2 mod 3, so if he starts with a multiple of 3 this is achievable. If he takes 1 mod 3 objects, I take 2 and vice versa. 

He would never win, since no multiple of 3 is an integer power of 2, and eventually would be forced to leave me with 1 or 2 objects, which I'd take for the win.

Assuming I don't know the value of N before I have to choose, I'd prefer to go first, which would give me a 2/3 chance of winning (if I know the value of N, obviously I'd prefer to go second if N is a multiple of 3).  

  Posted by tomarken on 2022-02-21 08:19:14
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (8)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information