You take these nine cards out of a standard deck (ace through 9 of hearts), put them all face up on a table and play the following game against another player:
Both players take turns choosing a card. The first player to have three cards that add up to 15 wins. The ace counts as one.
If both players play optimally, which player has a winning strategy?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
One of the coolest solutions I've seen so far on Brilliant. Upvote!
Nice Solution! (+1)
Log in to reply
Hey thanks, Samara!
For completeness, you have to justify the first line. IE how do we know that every sum to 15 is represented by a line of the grid?
This is a wonderful solution.
Log in to reply
Thanks, Vighnesh!
Log in to reply
Nice solution, very clever!
really a good solution (+1)!! :))
I disagree....only you will see these cards/numbers laid out like a tic tac toe because you created it or wanted the cards/numbers laid out so...looks like you want it to come across as a cryptography or some sorts...but if the cards laid out sequentially like in the picture or randomly.. then the first player is likely to win..
Log in to reply
Because both players are playing optimally, something as trivial as card position will not affect them. I agree in the real world where players do not play optimally mistakes will be made, just as not every tic-tac-toe game ends in a tie, but that's not what this question is asking.
Log in to reply
I agree with @El Sol . However you place the cards this is still essentially a tic-tac-toe game.
My belief was that in tic tac toe as long as the first person picked the middle (5) it was garunteed a win.
Log in to reply
Actually the first person definitely has the advantage, no doubt about that, but the second person can always force a draw (or a "cats game").
Wished there was a genius upvote on brilliant. This would have been the first solution to get it.
There are 12 partitions of 15 into 3 distinct integers (=cards). When the first player chooses their first card, the second player can choose one of the integers in the first players sequence either on the first or the second move. By doing this, the second player is choosing a sequence. The first player, seeing they will not win, can choose one of the distinct numbers in the seconds players sequence, so that none of them will be able to complete the sequence of three distinct cards adding up to 15.
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Combinatorial Games - Winning Positions
The cool part of this problem is when you realize you are just playing a regular game of Tic Tac Toe. Imagine if the cards were laid out as a magic square:
and the winner is the first to pick 3 cards that were in a row. All the combinations that add up to 15 are included in the magic square, which can be counted as follows:
And, as is well known for that game neither player can guarantee a win.