# Tag Info

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 ...
• 77.8k

### 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 ...

### 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,630
Accepted

### Can you beat random?

Here's how you win in the long run Expected number of losses Thanks to Evargalo for fixing the last calculation.
• 137k

### Can you beat random?

I agree with both answers, but the answer is a little simpler than their explanations. It can be simplified to: Those two rules alone cover every possibility. For completeness:
• 1,345

### Rock-Paper-Scissors but rock scores double

This probably isn't the answer you want but:
• 16.6k
Accepted

• 15.4k
Accepted

### Reverse dots and boxes

I would suggest an alternate (simpler) strategy:
• 950

• 263
Accepted

### Which parent should you start playing against?

Mary should play the parent first.
• 4,804
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):
• 8,248

### 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.
• 28.1k
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,167

### Which parent should you start playing against?

Mary should play her first game against To prove this, notice that if $n$ were even, For the case presented in the puzzle, with $n$ odd:
• 289
Accepted

### Guarantee a win in choosing numbers from extremes of a row of numbers

And the answer is... Why? Now:
• 4,059
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 ...
• 78.2k
Accepted

### A knight chased by three knights

Observation: Implication: Conclusion:
• 15.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 ...
• 137k
Accepted

### Game of the glasses on the windowsill

Here is my evaluation: Conclusion And yet...
• 30.6k
Accepted

### The Ultimate Battle of two players

Solution Define the recovery ratios $R_i$ for player $i$ $$R_1 = \frac{H_1}{A_2} \text{ and }R_2 = \frac{H_2}{A_1}$$ and the "turns-to-die" $T_i$ for player $i$ T_1=\Big\lceil\frac{P_1}{...
• 2,000

### 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

### 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 ...
• 77.8k
Accepted

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

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

### 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.5k
Accepted

### Lap Theory Optimal Betting Game

Their best strategy is Their chances with this strategy are Optimality
• 6,195
Accepted

### How long can you survive at the devil's playground?

You're screwed in constant time, no matter your speed, since the devil has a good strategy. I cannot claim to having found the devil's optimal strategy, but I do claim that there is an upper bound to ...
• 461

### Can you stop copy Alice?

Edit 2012rcampion observed that we also need to multiply by 2 the distances on the plane Not an answer with a strict proof of the final behavior, but instead a simulation with code that show a ...