A369368
Numerator of the maximum expected number of steps of a random walk on the cells of the hexagonal lattice before it lands on a mined cell, given that all but n cells are mined.
Original entry on oeis.org
0, 1, 6, 3, 24, 165, 2550, 10, 3090, 390, 1296, 265230
Offset: 0
For n = 0, the random walk stops before it can take any step, so a(0) = 0.
For n = 1, only the starting cell can be swept, so the random walk always stops after 1 step and a(1) = 1.
For n = 2, we can sweep the starting cell and one adjacent cell. The random walk then has probability 1/6 of surviving at each step, which implies that the expected number of steps is 6/5, so a(2) = 6. (The number of steps follows a geometric distribution.)
For n = 3, the best strategy is to sweep three mutually adjacent cells. As for n = 2, the number of steps follows a geometric distribution, now with the probability 1/3 of surviving at each step, so the expected number of steps is 3/2 and a(3) = 3.
See linked illustration for optimal solutions for 1 <= n <= 11.
A369370
Numerator of the maximum expected number of steps of a random walk on the cells of the triangular lattice before it lands on a mined cell, given that all but n cells are mined.
Original entry on oeis.org
0, 1, 3, 15, 3, 156, 15, 1284, 87, 642, 172, 2189, 149, 15, 2865, 215, 87
Offset: 0
For n = 0, the random walk stops before it can take any step, so a(0) = 0.
For n = 1, only the starting cell can be swept, so the random walk always stops after 1 step and a(1) = 1.
For n = 2, we can sweep the starting cell and one adjacent cell. The random walk then has probability 1/3 of surviving at each step, which implies that the expected number of steps is 3/2, so a(2) = 3. (The number of steps follows a geometric distribution.)
For n = 3, the best strategy is to sweep the starting cell and two of its neighboring cells. Let x be the expected length of the random walk with the given starting cell, and let y be the expected length of a random walk starting at one of the other two cells. By conditioning on the first step, it follows that the equations x = 1 + y*2/3 and y = 1 + x/3 hold, giving x = 15/7 and a(3) = 15.
See linked illustration for optimal solutions for 1 <= n <= 16.
A366999
a(n) is the denominator of the maximum expected number of steps of a random walk on the square lattice until it lands on a mined lattice point, given that mines are placed on all but n points.
Original entry on oeis.org
1, 1, 3, 7, 13, 3, 41, 37, 67, 2, 274, 103487, 71, 607
Offset: 0
Showing 1-3 of 3 results.
Comments