Here is a relatively quick way to get an approximate answer.
Let $k$ be the number of steps to the end (in this case $12$), and $n$ the number of sides on the die.
First you need to look at the end game.
Now to estimate the number of throws until we reach the end game:
We need to minimise this.
With a little more work than Jaap's very nice approximate answer we can explicitly calculate the values we need. Pick a die -- say it has $n$ sides -- and let $a_j$ be the expected number of turns when you are $j$ spaces away from winning. Obviously $a_0=0$, and Jaap's insight about how the game ends shows that $a_j=1/n$ when $1\leq j\leq n$. After that we ...
This game is also known as Treblecross.
There is a neat way to think about this game. As soon as you place an X next to another X, or one away from another X you lose because the opponent can make three in a row. Therefore the Xs need to be a distance of at least 2 apart. You can think of each X being in the middle of a 3x1 bar that you place on the board, ...
Simulating in C# / LINQPad:
Random rnd = new Random();
// Define other methods and classes here
var tries = new List<List<int>>();
for (int n = 2; n <= 12; ++n)
var dieTries = new List<int>();
for (var t = 0; t < 500000; ++t)
I found several by hand with 13 steps, then wrote a program... which found hundreds more solutions with 13 steps, and I was beginning to think that maybe there was no solution for 12 and then my program spat-out this:
Edit1: Another solution found by the silly program:
Edit2: I have my code available. It is written in Java. I tested it against the earlier ...
Here's another solution using the fact that $\triangle ABC$ and $\triangle ABD$ have the same area if $AB \parallel CD$:
The reason is that $CE = DF$, so $\frac12 AB \cdot CE = \frac12 AB \cdot DF$.
Now, since $DG \parallel EK$ and $BD \parallel EG$, we have
$\triangle DGK = \triangle DEG = \triangle BEG$ in area:
The result is hence
The diameter of the smallest circle is
The configuration is an instance of a
modified by the geometric transformation
We start with a similar but more symmetrical figure
Then we apply inversion in the circle centred at R
It is easy to verify that, by the properties of inversion in a circle, circle E is mapped to line OJ (circle E passes through R so it ...
The diameter of the smallest circle is
Let's put the figure in a Cartesian plane: (half of the figure is omitted due to symmetry)
Denote the radii of the four circles by $R_P = \frac12$, $R_A$, $R_B$, and $R_C$, respectively.
We see that $R_A$ is the ordinate of $A$ and that $1 - R_B$ is the ordinate of $B$.
Since $PA = R_A + \frac12$ is also the distance ...
This is actually much easier than it looks. You can simply use any consistent method for separating the the tetrad pieces. By consistent I mean that if two stage 3 positions can be brought to a stage 4 position by the same set of moves, then the two positions get the same tetrad twist number. Note however that you don't need to figure out what those moves ...
Multiple answers seem to be valid, for example
It seems that the question was in fact missing a tag, as I needed to make use of
to arrive at the answer process which was:
Perhaps the flavour text about the donuts
Taking the clues given:
For the "wrong" answer given:
for example (explaining the examples given at the start of ...
I decided to let my computer solve it, and it found the following solution:
This is the same as hexomino's latest solution, who updated his post with this shortly before I posted this answer.
Assuming my program is correct, this is optimal.
To show this is indeed a solution:
The second-best solution has box sizes that are coprime:
Using 4 or 5 display ...
I found this:
If this is right, it took me four tries, so while not trivial, I'm not sure I'd label it as 'Expert' unless that is low on your scale of difficulty. Otherwise maybe I am not understanding the rules. But I can see how the mechanics could make later puzzles much more interesting. Keep up the good work!
Here's a "manual" solution.
Let's start by noticing that there are 21 changes between consecutive digits (there are implicit zeroes to the left and the right), and an operation can eliminate at most 2 of them, one at either end of the changed digit string. This means that 11 moves is an absolute lower bound.
So, let's start by finding all the ...