Enjoyable Enigmas #2: Who Wins the Matchstick Game?

  • Thread starter Enigman
  • Start date
In summary, the conversation discusses a new book of puzzles and two different games - one involving matchsticks and one involving a boxing tournament with a specific number of participants. The winner of the matchstick game is determined by making the best possible move, while the winner of the boxing tournament is not specified. The conversation also mentions the possibility of a player receiving a bye in the tournament and whether it is possible to get 1 gallon of water using specific tools and resources. The solution to the last question is dependent on the rules and limitations set by the players.
  • #1
Enigman
640
312
Can't find the old thread but I did find a new book of puzzles.

Two players, A and B, take turns in the following game. There is a pile of six matchsticks. At a turn, a player must take one or two sticks from the remaining pile. The player who takes the last stick wins. Player A makes the first move and each player always makes the best
possible move.
Who wins this game?
 
Physics news on Phys.org
  • #2
B can always win. Let's see if I've got my logic right.
Code:
              6                          // start w 6
A       5         4                      // A takes 1 leaving 5, or A takes 2 leaving 4
B       3         3                      // B always takes enough to leave exactly 3
A     2   1     2   1                    // A takes 1 or 2, but it always leave 2 or 1
B     0   0     0   0
On the first move, if A takes 1, B should take 2.
If A takes 2, B should take 1.
Either way, here's 3 left.
There's nothing A can do but to leave either 1 or 2, meaning B can always win.

Thanks! I enjoyed that!
 
Last edited:
  • #3
Or, more general:
If you can, always leave a multiple as 3 as remainder. No matter what the opponent does, you can repeat this, including zero where you win. All multiples of three are losing positions (you lose if it is your turn, you have to move to a winning position for the opponent), all others are winning positions (you win if it is your turn, you can go to a losing position).
 
  • #4
Both correct!

Next one:
In a boxing tournament there are 150 participants. First set consists of 75 matches, the second set of 27 matches with one player being given a bye and so on.
How many matches are held? What if the number of participants was N, where N is an arbitrary whole number?
 
  • #5
Every match kicks one participant out of the tournament, one wins => N-1 matches

For N participants, can you make sure no one gets more than one bye?
 
  • #6
Match the participants who have gotten a bye with each other after a second person gets the bye.
If we have only a 4 gallon and a 6 gallon jug and a lake full of water, is it possible to get 1 gallon of water? If so, how?
 
  • #7
Depends on the things we allow.
Just with filling them completely back and forth it is not possible, as all quantities are always a multiple of 2 gallons then. If we find some way to fill the 6 gallon jug to 50% (e.g. by tilting it, if it has a rectangular shape) it is possible (and easy).
 
  • #8
Correct.
QO4kiyY.png

Note: I haven't solved this one yet.
(Second Note: Probably why I am pushing the rock off the cliff in first place.)
 
Last edited:

FAQ: Enjoyable Enigmas #2: Who Wins the Matchstick Game?

1. What is the Matchstick Game?

The Matchstick Game is a mathematical puzzle where two players take turns removing either one, two, or three matchsticks from a pile. The player who removes the last matchstick wins.

2. How do you play the Matchstick Game?

To play the Matchstick Game, start with a pile of matchsticks and have two players take turns removing either one, two, or three matchsticks from the pile. The player who removes the last matchstick wins.

3. Is there a winning strategy for the Matchstick Game?

Yes, there is a winning strategy for the Matchstick Game. The player who goes first can always win by following a specific pattern to ensure they remove the last matchstick. However, if the pile starts with a number of matchsticks that is a multiple of four, the second player can also use a specific strategy to win.

4. Can the Matchstick Game be solved using mathematics?

Yes, the Matchstick Game can be solved using mathematical principles. It falls under the category of combinatorial game theory, which studies two-player games with perfect information and no chance elements. The game can be solved using mathematical formulas to determine the winning strategy for each player.

5. Are there variations of the Matchstick Game?

Yes, there are many variations of the Matchstick Game. Some variations include using different numbers of matchsticks, allowing players to remove more or less than one, two, or three matchsticks at a time, or adding conditions for when players can or cannot remove matchsticks. These variations can make the game more challenging and interesting.

Similar threads

Back
Top