# Tag Info

## Hot answers tagged strategy

Accepted

### The total cost of salaries in a company

Here's my solution:
• 8,058
Accepted

### Deceptive dice game

You can make arbitrarily large sets of dice with this property. Start with Efron's dice: A: 4, 4, 4, 4, 0, 0 B: 3, 3, 3, 3, 3, 3 C: 6, 6, 2, 2, 2, 2 D: 5, 5, 5, 1, 1, 1 A beats B, B beats C, C ...
• 33.7k
Accepted

because:
• 2,847
Accepted

### How to get a bowl with one liter of water

The volume filled is:
• 5,190
Accepted

### The Dwarves' Test

A dwarf with a red dot will A dwarf with a blue dot will Therefore, on the $N$th day, all dwarves with red dots are present, and all dwarves with blue dots are not.
• 33.7k

### Red and Blue in the Chocolate Fountain Room

The prisoners agree that: Each prisoner with a blue nose will: Each prisoner with a red nose will:
• 21.9k

### √2 without pressing √ on a Scientific Calculator

One possibility, if starting with an operation automatically prepends Ans: Why does this work?
• 146k
Accepted

### Pirate democracy at its finest

I have a hunch that the answer is Explanation: Continuing this way, we see that
• 28k
Accepted

### Is there any easy way to solve this lock puzzle?

There is an easy way to solve it in the minimum number of moves. The reason this works is:
• 53.3k
Accepted

### Can the Policeman catch the Thief?

Yes, the policeman can catch the thief, although it may take a very long time. In particular, the following strategy works: The policeman starts in the center. First, he makes a counterclockwise loop ...
• 7,881
Accepted

### There are 2,001 doors leading to 2,001 hallways. How quickly can you find the way out?

Let's number the hallways (doors) from $1$ to $2001$ from west to east. One important observation is that: This is because: Now, another important observation is that, if a dead-end room connects ...
• 34.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.9k

### How can one solve a Rubik's cube without relying on guides/algorithms?

There are three techniques that allow you to come up with useful move sequences for solving a cube. Conjugation This is where you already have a move sequence that does one thing and allows you to ...
• 53.3k
Accepted

### retsubkcolB Spelled Backwards

Solved in 10 moves including "Add a comment" and "Add Comment" buttons at the start and end I was muddling around in the "inspect element" for way too long trying to ...
• 598
Accepted

• 976

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

### lolcatz can haz ur infinit cheeseboard

Unless I'm mistaken, the result is Reading through the wall of text, the rules seemed a bit too complicated for it to be "just some random game", so figuring out the magic seemed ...
• 77.4k
Accepted

You need to ask

### What is the minimum number of helpers that an explorer need to cross the desert?

The answer should be Here is how you do it.
• 7,679
Accepted

### 16 pawns on a chess board with no three collinear: how do I go about solving this?

The Algoritm is : Then Here is the complete solution from Achim Flammenkamp Ph.D. There are totally 57 solutions
• 17.9k
Accepted

### Titanic Tic-Tac-Toe

The first player can always force a win. I wrote this Python script to analyze the tree of possible game states reachable from an empty starting board. No matter what the second player does, the ...
• 6,449
Accepted

### Strategy for solving Flow Free puzzles

It's quite funny actually. I was terrible at these puzzles until I started writing this answer. To demonstrate the strategies that I completely and suddenly winged out of nowhere, I will solve the ...
• 9,937
Accepted

### You trolls, get out of my party!

Solution: This was about the same thing I said before. But now... See Trenin's answer for a different formulation of the same approach, in case that one is easier to understand. Previous attempt at ...
• 18.1k
Accepted

• 16.2k

### Finding digits that sum to 15

The solution: The reason:
• 146k
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.
• 136k
Accepted

• 2,081
Accepted

### Playing with one Queen on a chessboard

We can work backwards to figure this out: Conclusion:
• 146k
Accepted

### 1000 gold coins to share with the king

It might be possible to do a little better, but I think I can get Explanation:
• 3,241