36

I wrote a computer program and it showed that $18$ moves is the optimum. Here is one such solution: Oddly enough, even if you relax the condition of alternating white and black moves, it cannot be done in fewer moves. For $3\times3$ the optimal number of moves is $16$. Without the need to alternate moves the optimum is $14$ moves, for example just by ...


23



23

(Kind of) analytical solution that only requires small amount of calculations, (potentially) doable by hand. First step: we can safely drop 2, 3 and 7 from the equation as those digits are used in 23 and 17. Now, we need to build a prime from: 5, 11, 13, 17, 19, 23, 29 and 31. Second step: let's try to build the shortest number possible from these numbers. ...


22

The answer is I wrote a Java program to find it:


20

The answer is: Here's the way you get that number:


19

I believe I've found a solution worth 16 points.


18

The answer is 7, It's a simple extension of the Magic Calculator trick. Each card represents a bit, with the upper left index value being the value of that bit. To perform it as a trick, you ask the volunteer to pick a number between 1 and 64, and hand you the cards on which their number appears. Add up the index values on the selected cards, and you have ...


16

@hexomino has found optimal solutions with a restricted search space. Theorem: Proof: Therefore Theorem Proof Therefore


15

So I can't yet prove this is the smallest, but it's at least an upper bound: Reasoning:


14

Shuffling the sequence of 5 and the non- overlapping 19, 23, and 29 by trial and error produces:


14

I managed to find the 8 in So we are trying to find the 5th largest card in a bunch of 12, by measuring them in batches of four. Here's my strategy: Now we have identified, for certain, a couple of cards we can exclude: A1 and A2 (both have at least 8 cards smaller than them), and B4, C2, C3 and C4 (all have at least 5 cards bigger than them). We also have ...


13

Sum Product Reasoning


13

I believe I can open it in The reasoning behind it is:


13

You only need Assume the genuine coins weigh $x$ grammes. Credit to Hexomino and Jaap for the corrections!


12

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 appears that I should have chosen a fairer game to distribute the coins...


11

It takes Suppose Now


11

This is like a reverse puzzle to the well-known Here in reverse: A remark as a thinking outside the box solution:


11

Between 10 friends, there are only 45 unique pairs. Each friend will participate exactly 9 times, which means after 45 rounds everyone will be level 10. Since it's impossible to get an item on the first & last run, there is a theoretical maximum of 43 items you can get. However, due to some restrictions, it seems to me like it's impossible to get this ...


11

EDIT: Some have suggested that the question might be to find exactly 111 squares. In this case, ORIGINAL ANSWER Let's count


10

Got 19 by moving around... might be possible to do better:


10

Thinking about this problem in reverse is easier, i.e. think about the trees that need to remain. Find the fewest number of trees that can be arranged in five lines with 4 trees in each line. To minimise that number, we need as many trees as possible to do double duty by being part of multiple lines.


10

Improvement on the 2-explorer case: First attempt at 3-explorer case, using the same strategy and formatting:


9

If the answer isn't 8, then how about


9

Here's the solution, and a proof of its optimality: First, an important fact: Now, analysing the grid: Constructing the solution:


9

I think the answer for $14 \times 14$ is Achieved as follows While the best I've achieved for $9 \times 9$ is Achieved as follows


9

I may need some clarification on counting but I think I've found a solution in which the landlord needs to repair 38 squares while filling just 3 other apartments with water. Solution Partial Reasoning


8

A solution in: Borrowing from @Jaap:


8

My solution (but see my new, second answer): EDIT: thanks to @mlk.


8



8

@Oray congrats this question is glorious!


Only top voted, non community-wiki answers of a minimum length are eligible