# Tag Info

My most sincere apologies for this. Really.
Accepted

### Desegregate the Knights

Give these names to all the squares: 163 4 8 725 Each number can only be accessed by way of the numbers before and after it (where 8 wraps around to 1). That ...

### Switch The Knights

I found a solution that uses 16 moves. After exhaustively checking that there is no solution in 14 moves, I conclude that 16 moves is optimal, because after any odd number of moves the number of ...
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 ...
Accepted

### Switch The Knights

You need at least 16 Moves. Let's make the task visually more simple. The initial board is: a4 b4 c4 a3 b3 c3 a2 b2 c2 a1 b1 c1 We cut it into 12 cells ...
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 ...
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 ...
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 ...
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 ...
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 ...
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 ...
Accepted

This is Proof:

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

### Switch The Knights

Edit: Now that @GOTO 0 got it in 16, I can at least prove that his solution is optimal. Proof: My best was:
Accepted

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

### 23 Clones and Two Lightbulbs

The standard solution is that all clones signal their first passage using some state of the bulbs to an elected clone, the "counter", who counts how many there are. You need to address 3 things. 1. ...
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:

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

### Rank the Fencers

There are $5!=120$ possible orderings of the fencers, so we need $\log_2(120)\approx 6.9069$ bits of information. Each duel provides at most $1$ bit of information, so at least $7$ duels will be ...
Accepted

### Half-reverse operation on binary strings

Consider the set of binary strings that are lexicographically earlier than their reverses. For example, 011, 1011, and ...

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 ('...