# Tag Info

## Hot answers tagged game-theory

Accepted

### Rock, Paper, Scissors and Trump

Looks like One strategy would be to The opponent will naturally soon realise what's happening. But it won't help. Here are the possible results from Alicia's point of view: So whatever the ...
• 68.2k

### Will a greedy algorithm solve Tatham's Flood?

It's definitely not optimal! Here's a counterexample: Start from the white area. Greedy algorithm would make you do all the colours on the top right (5 moves: yellow, green, dark green, blue, dark ...
• 11.7k

### Will a greedy algorithm solve Tatham's Flood?

That problem is NP-hard, so an efficient strategy to calculate the optimal moves would be a major breakthrough in computer science. Of course, there might be a greedy strategy, but not an efficient ...
• 1,065

### Shortest game of Monopoly

If you are trying to lose the game as quickly as possible then you can do it in 1 turn and 2 rolls of the dice. This is using the UK version as I'm not sure about the US one. Roll 1: Roll 2 (Because ...
• 2,552
Accepted

### Who shall come to the tea party?

All but Mr. Bun will attend the tea party, with Duke Froggington II as the guest of honor. The total number of animals who will be attending the party is $(6*12+2)-1=73$. Looking at some specific ...
• 3,066
Accepted

### Tic-tac-toe 1000 in a row

Yes, X can win. To simplify things I'm going to take advantage of your rules that O cannot win, so that X doesn't need to worry about O getting 1000 in a row. Just consider a 1 dimensional game, ...
• 1,048

### Who shall come to the tea party?

I am not myself a perfect logician, but here the behaviour I observed at my own tea parties, and the explanation my own favourite nounours gave as years passed. Party of one This issue was quickly ...
• 487
Accepted

• 14.5k
Accepted

### Reverse dots and boxes

I would suggest an alternate (simpler) strategy:
• 940
Accepted

### Winning strategy in a calendar game

I think that your proposed method is correct. Here's a quick visual representation of the same method (by no means a formal proof):
• 7,070

### Angels & Demons (Open question)

I just came back home and was about to draw a diagram illustrating this, but I can't do any better than @noedne already did.
• 27k
Accepted

### 2019 gold coins to share

I can ensure that I receive at least To get this amount of coins, I could apply the following strategy: My friend can also ensure that I do not get more coins than this in the following way: So it ...
• 5,057
Accepted

### What is the optimal strategy for the Dictionary Game?

Let's assume every player knows the exact same list of words. Player 1 can ensure a loss for player 3 on the first turn by selecting the second word from the list. This allows player 2 to pick the ...
• 67.4k

### Shortest game of Monopoly

No, the game given in the OP is not the shortest possible Monopoly game (using the American edition). As with the UK edition solution given by William Pennanti, a two-player game can be lost in a ...
• 251
Accepted

### A knight chased by three knights

Observation: Implication: Conclusion:
• 9,805
Accepted

### Buzzword Bingo Boss Battle!

So, we are playing misère Tic-tac-toe with the option of taking more than one turn in a row. Seems quite interesting, so let's take a stab at it. The flow of the narrative here is a bit messy, because ...
• 68.2k
Accepted

### The median game

Consider that Given that, I see play proceeding as follows N.B. I'm assuming here that strategies which are equally optimal for a given player are equally likely to be executed. This seems to be ...
• 123k
Accepted

### Reverse dots and... cubes? - Snowflake edition

The player who can win is by this strategy:
• 136k

### Playing blindfolded 2048

Source: I played this game a lot while distracted and this seems to work pretty well. [Sort of unrelated, but 2048 is one of the first C++ programs I wrote. Code is here: link to code.]
• 10.1k
Accepted

### Lap Theory Optimal Betting Game

Their best strategy is Their chances with this strategy are Optimality
• 2,816
Accepted

### Devious auction game

Case I: Let us suppose that each player can bid any integer equal to or above the current minimum bid. Then: Barry O'Neill develops a simple formula for this strategy in a 1986 article in the ...
• 465
Accepted

• 13.4k
Accepted

### Reverse dots and boxes, swastika edition

First player wins Example:
• 18.4k

• 2,872
Accepted

### Who Wins At Horsie-Push?

Here's the situation: Working backwards... Keep going... Therefore... So finally...
• 4,975
Accepted

### Pirate Puzzle Double Twist

The 4th and 5th pirates... Also... Why this might work... Why does the third even consider going along... So it all depends on...
• 9,301

### Dollar Auction with Perfect Logicians

I believe Why: Additionally, As such,
• 4,597