# Tag Info

My most sincere apologies for this. Really.
• 77.6k
Accepted

### What's the optimal strategy for Wordle?

Assumptions: Optimal firstly means never losing (rather than some definition of a good average depth). The 12972 words in the Wordle source code are the only valid guesses. The target word is ...
• 366
Accepted

### Two Cannons - A Beginner's Physics Puzzle

Alain Remillard has given the mathematician's answer. Here's the physicist's one: Step 1: Obviously, in such a universe, regardless of their speed, the cannonballs will travel in a straight line and ...
• 77.6k
Accepted

### Wolves and sheep

Perform tests of nine sheep on all but one sheep according to the illustrated patterns: The two important properties exhibited are The claim is that given a set of test results there is at most one ...
• 15.4k
Accepted

### Mystery operation

Ok, I think I got something. The answer should be : The ancient civilization The operation *|* is performed : Now, the real problem. In order to obtain the ...
• 11.5k
Accepted

As atonement for my insolent lateral-thinking answer, I offer an optimality proof. If you keep repeating the correct code, the are six possible different orders: 1 abcdabcdabcd 2 abdcabdcabdc 3 ...
• 77.6k
Accepted

### Exterminating blobs on a grid

Given an arrangement of blobs, how can you determine whether it is possible to exterminate them all? What strategy can you use to succeed when possible? Warning: what follows is a constructive but ...
• 15.4k
Accepted

### Three knights searching for a princess in a castle

The knights need a maximum of: I made a quick drawing to show my strategy. The yellow squares are the rooms the knights look into that night, the black squares are rooms in which the princess ...
• 1,584
Accepted

This is Proof:
• 53.4k
Accepted

### Can you recreate this fractal I randomly made?

The pattern is self-similar, and can be formed by repeatedly scaling and rotating copies of itself: An alternate dissection that fits in a diamond:
• 18.9k

### Can you recreate this fractal I randomly made?

There are only 16 different possible state combinations of the four ancestor cells, and you can find them all in the image, so there is a unique answer. The rule is as follows:
• 2,684
Accepted

• 23.6k
Accepted

### Programmatically solving a math puzzle with four unknowns and four equations

First of all, let's see why your brute-forcing fails. (This is the puzzle part, the rest is plain old math.) No matter which you chose, the number at the bottom right would have to be both odd and ...
• 77.6k
Accepted

### Blindfold Bingo

I have a solution with a success rate of 93.5%, according to my simulations. The reason this solution works so well is Here's my code that I used to verify my solution:
• 7,129

### Wolves and sheep

Thinking out loud, not a solution yet, but spoilery enough that I didn't want to put it in a comment: However, Still-not-an-answer UPDATE: However, I also notice that the situation is not ...
• 2,230
Accepted

### Find Local Maximum in an Integer Sequence

It is possible to solve up to $n=20$ cells using only $m=6$ moves. In particular, it is not possible to answer the bonus question as stated.
• 53.4k
Accepted

### 1+3 Towers of Hanoi

From this we get the recursion formula with solution UPDATE As @PM2Ring points out in the comments there is a prettier way of writing the closed formula: The first few values are
• 6,057

• 35.6k
Accepted

### GameDev: stuck with first puzzle design, would love resources to study from or algorithm suggestions!

This is related to the mathematical field of graph theory, and your puzzle is essentially a finite-state machine. Each platform has 8 possible states, so the entire system has $8^3=512$ states ('...
• 28.1k

### The dessert problem (blind ballot remaining blind if non-unanimous)

I know nothing about the "black balling" method mentioned in the problem, but hearing the term got me thinking about an easy solution: The only issue I see with this system is: Edited to ...
• 2,963
Accepted

### Is it possible to scramble a Rubik's cube so that each face has no more than 2 squares of the same color?

Yes it is possible! Do you know how to get it into a checkered state? Looking at any face you then do as follows.... Keep the same face towards you the entire time. Turn left side clock-wise Turn ...
• 126
Accepted

### An $n$-sided polygon with area $n$

Are all $n$ possible? Then is it possible to construct them?
• 34.2k

### SafeCracker #3 - We've Been Blocked

The doesn't belong, because
• 3,933