Tuesday, March 12, 2019

strategy - Coins on a table


John and Jane are playing a game. They both go to the bank and get 1000 euros in 2 euros. So each of them has 500 euros at stake. They then find a large rectangle table and decide who wins the following game gets to keep all of the coins currently at the table. The rules are as follows:



  • It is a turn-based game, so John and Jane take turns alternatively (1 coin per turn)

  • The coins are placed on the table and they cannot be put on top of each other.

  • Coins may not be moved once put on the table

  • Assume the table isn't large enough to hold all the coins

  • If there isn't any room to put coins on the table, the person who placed the last possible coin wins.



What is the winning game strategy?



Answer



The winning strategy for the first player is to put their coin in the dead center of the table. Then whatever move their opponent makes, they exactly mirror it, around the center.


e.g. If the second player puts their first coin 1 inch to the left of the center coin, the first player mirrors this by putting their coin 1 inch to the right of the center coin.


It's relatively easy to see why this works. If a spot is free for player 2, then its mirroring spot must also be free for player 1 because after each turn player 1 takes, there will be no unmirrored spots left. This means that wherever player 2 goes, there's guaranteed to be a spot left for player 1. So the only person who can possibly reach a state where there's no spot to go is player 2, who inevitably loses (unless they didn't bring enough coins to cover their table!)


No comments:

Post a Comment

classical mechanics - Moment of a force about a given axis (Torque) - Scalar or vectorial?

I am studying Statics and saw that: The moment of a force about a given axis (or Torque) is defined by the equation: $M_X = (\vec r \times \...