It's time to play Bingo!

As displayed on the puzzle page, a random Bingo game is generated based on a given seed, and your goal is to win. We have a grid of 5x5 numbers. The opponent has a grid of 5x5 numbers. Last, there is a numbers called grid, showing the numbers that will be called in the game. The game stops the first time we or the opponent have a horizontal, vertical, or diagonal line of five numbers. Theoretically, the puzzle can be solved by playing until we get lucky. Practically, this is exceptionally unlikely and we'll need to be smarter.

We can enter an arbitrary seed into the input box, as long as it's 1 to 9 unique letters. We're looking for the seed that lets us rig the Bingo game in our favor. By taking a fixed seed and tweaking one letter at a time, we first find that only some letters affect each grid. The 1st, 4th, 7th letters affect our numbers, the 2nd, 5th, 8th letters affect the opponent's numbers, and the 3rd, 5th, 9th letters affect the numbers called. We can view each letter like a function that transforms the grid. If the seed is shorter than 9 letters, the corresponding functions are skipped. We start with the opponent's numbers first, since they're easiest to understand.

The opponent's grid has the same numbers as the numbers called grid, in the same order, except with some out of place negatives -1, -2, etc.

The way this grid works is that each letter maps to a position 0 to 24 in the grid. Let that position be x. Then:

- 2nd letter places a negative number at x
- 5th letter places a negative number at x and x+1, rolling over if at the end
- 8th letter places a negative number at x and x+3, again rolling over if needed.

The remaining spots are filled with the numbers called grid, left-to-right then top-down.

The values of x can be found by entering various 2-letter seeds and checking what gets covered. The mapping between letters and positions is:

A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|

17 | 0 | 4 | 16 | 0 | 6 | 20 | 13 | 14 | 1 | 19 | 23 | 15 | 3 | 7 | 2 | 21 | 24 | 2 | 9 | 11 | 10 | 5 | 22 | 1 | 18 |

Our numbers and the numbers called work identically. Each letter is a function that is applied to the existing grid of numbers. For our grid, the function for the 1st letter is applied, then 4th, then 7th. For the numbers called grid, it's 3rd, 6th, then 9th. Once we understand this is how it works, we can first try a seed shorter than 3 letters to get the original numbers called grid, then try varying 3-letter seeds to observe each function in isolation.

Most functions shuffle the numbers around, then adjust all numbers in the grid by some amount. The full list of functions is below. Not all functions need to be derived to solve the puzzle.

Letter | Operation | Then add: |

A | Shift row 1 left by 1 | -3 |

B | Shift column 3 up by 2 | -1 |

C | Shift rows by 0/1/2/1/0 right | -2 |

D | Shift 1st row left by 1, last row right by 1 | 0 |

E | Shift columns down by 0/1/2/3/4 | -4 |

F | Swap rows 2 and 4 | -1 |

G | Swap columns 1 and 5 | -2 |

H | Shift columns up by 0/1/2/3/4 | -3 |

I | Shift 1st row right by 1, last row left by 1 | -4 |

J | Swap corners diagonally | -1 |

K | Shift row 4 right by 1 | -3 |

L | Rotate 180 degrees (same as reversing) | -3 |

M | Subtract 4 from last row | 0 |

N | Swap 3rd and 5th column | 0 |

O | Keep numbers in place | -3 |

P | Shift first 2 columns down by 2 | -2 |

Q | Shift column 3 down by 2 | -3 |

R | Shift last 2 columns up by 2 | -1 |

S | Move 1 forward along a spiral, starting top-left and going clockwise, with center looping to top left | 1 |

T | Reflect across top-left bot-right diagonal | -1 |

U | Reflect vertically across y-axis | -2 |

V | Shift rows left 0/1/2/1/0 | 0 |

W | Consider the 3x3 center. Swap corners of that center diagonally | -2 |

X | Reflect across top-right bot-left diagonal | -1 |

Y | Reflect horizontally across x-axis | -2 |

Z | Shift row 2 right by 1 | -1 |

These functions all ensure that if our original grid is 25 unique numbers, then the new grid is 25 unique numbers. The exception is the letter M. If any grid ends with a duplicate number, the game is declared invalid, but the output grids are still displayed.

After determining enough functions, we should be able to regenerate the original configuration. The initial numbers called grid can be found with any seed shorter than 3 letters, and the initial version of our grid can be found by trying a known 1-letter seed and applying the function in reverse. The largest numbers in our grid and the smallest numbers in the numbers called grid are highlighted, for reasons that will be clear later.

Our grid:

8 | 15 | 4 | 10 | 11 |

53 | 7 | 3 | 30 | 23 |

25 | 33 | 2 | 1 | 34 |

12 | 9 | 26 | 13 | 48 |

21 | 40 | 5 | 15 | 27 |

8 | 15 | 4 | 10 | 11 |

53 | 7 | 3 | 30 | 23 |

25 | 33 | 2 | 1 | 34 |

12 | 9 | 26 | 13 | 48 |

21 | 40 | 5 | 15 | 27 |

Numbers called:

77 | 88 | 82 | 61 | 81 |

80 | 71 | 96 | 53 | 97 |

67 | 70 | 66 | 91 | 90 |

76 | 47 | 94 | 74 | 69 |

92 | 46 | 73 | 79 | 68 |

77 | 88 | 82 | 61 | 81 |

80 | 71 | 96 | 53 | 97 |

67 | 70 | 66 | 91 | 90 |

76 | 47 | 94 | 74 | 69 |

92 | 46 | 73 | 79 | 68 |

The smallest number in the numbers called grid is 46. The 5th largest number in our grid is 33. For a bingo to even be possible, we must bring at least the 46 to the 33, covering a distance of 13. Covering any less distance would leave at most 4 common numbers between the two grids.

Functions range from offsetting by +1 to -4, with only one +1 function, so the bingo is only possible if we apply three -4 functions to numbers called and one +1 function to our numbers. This forces the seed to be length 9. It also means the winning numbers should start as exactly 13 larger than the 5 largest numbers in our grid. These are the numbers highlighted above in the numbers called grid.

Consider the numbers called grid first. There are only 2 functions that subtract 4 from all squares, E and I. The M function subtracts 4, but only from the last row of numbers. All 5 target numbers (highlighted above) must get -4 applied three times, so we must apply functions E and I in some order to get all 5 to the last row for M. The correct application order is I, E, M.

Seed so far: ??I??E??M

After I:

77 | 73 | 84 | 78 | 57 |

76 | 67 | 92 | 49 | 93 |

63 | 66 | 62 | 87 | 86 |

72 | 43 | 90 | 70 | 65 |

42 | 69 | 75 | 64 | 88 |

77 | 73 | 84 | 78 | 57 |

76 | 67 | 92 | 49 | 93 |

63 | 66 | 62 | 87 | 86 |

72 | 43 | 90 | 70 | 65 |

42 | 69 | 75 | 64 | 88 |

After I + E:

73 | 65 | 86 | 83 | 89 |

72 | 69 | 71 | 66 | 82 |

59 | 63 | 80 | 60 | 61 |

68 | 62 | 88 | 74 | 84 |

38 | 39 | 58 | 45 | 53 |

73 | 65 | 86 | 83 | 89 |

72 | 69 | 71 | 66 | 82 |

59 | 63 | 80 | 60 | 61 |

68 | 62 | 88 | 74 | 84 |

38 | 39 | 58 | 45 | 53 |

After I + E + M:

73 | 65 | 86 | 83 | 89 |

72 | 69 | 71 | 66 | 82 |

59 | 63 | 80 | 60 | 61 |

68 | 62 | 88 | 74 | 84 |

34 | 35 | 54 | 41 | 49 |

73 | 65 | 86 | 83 | 89 |

72 | 69 | 71 | 66 | 82 |

59 | 63 | 80 | 60 | 61 |

68 | 62 | 88 | 74 | 84 |

34 | 35 | 54 | 41 | 49 |

We need to stop the opponent from winning. Since our 5 winning numbers are the last 5 numbers called, all 25 numbers will be called in the game. This means all opponent squares will be filled before our bingo, except for the negatives. We need to place 5 negatives in the grid such that filling all 20 other squares does not result in a bingo.

For this to occur, there must be exactly one negative number in each row and column. Let x, y, z be the positions of the 3 letters used. Negatives are placed at x, y, y+1, z, z+3. Since we cannot have y and y+1 in the same row, y must be 4 mod 5 (in the last column).

y5 | y1 | |||

y1 | y2 | |||

y2 | y3 | |||

y3 | y4 | |||

y4 | y5 |

y5 | y1 | |||

y1 | y2 | |||

y2 | y3 | |||

y3 | y4 | |||

y4 | y5 |

Any choice of y will cover the 1st and 5th columns. The z and z+3 locations must also be in different rows, but also cannot be in either the 1st or 5th column. This forces z to be 3 mod 5, in the 4th column.

y5 | z5 | z1 | y1 | |

y1 | z1 | z2 | y2 | |

y2 | z2 | z3 | y3 | |

y3 | z3 | z4 | y4 | |

y4 | z4 | z5 | y5 |

y5 | z5 | z1 | y1 | |

y1 | z1 | z2 | y2 | |

y2 | z2 | z3 | y3 | |

y3 | z3 | z4 | y4 | |

y4 | z4 | z5 | y5 |

This leaves placing x in the middle column.

y5 | z5 | x1 | z1 | y1 |

y1 | z1 | x2 | z2 | y2 |

y2 | z2 | x3 | z3 | y3 |

y3 | z3 | x4 | z4 | y4 |

y4 | z4 | x5 | z5 | y5 |

y5 | z5 | x1 | z1 | y1 |

y1 | z1 | x2 | z2 | y2 |

y2 | z2 | x3 | z3 | y3 |

y3 | z3 | x4 | z4 | y4 |

y4 | z4 | x5 | z5 | y5 |

By doing some casework (place y, then z, then x), we find there are 4 solutions that block all rows, columns, and diagonals:

- x=12, y=4, z=18
- x=12, y=19, z=2
- x=17, y=24, z=8
- x=7, y=24, z=13

Looking at our letter to position map:

A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|

17 | 0 | 4 | 16 | 0 | 6 | 20 | 13 | 14 | 1 | 19 | 23 | 15 | 3 | 7 | 2 | 21 | 24 | 2 | 9 | 11 | 10 | 5 | 22 | 1 | 18 |

There is no 12 and there is no 8. The only solution left is x=7, y=24, z=13, giving letters ORH.

Seed so far: ?OI?RE?HM

For our grid, there is only 1 function that adds 1, letter S (which applies a spiral). There are then 3 other functions that add 0, from D,N,V. We want to combine S with two of these letters (in some order) such that the 5 smallest numbers all end up on one Bingo line. By playing around with the functions in varying orders, we find the answer is to apply N, then S, then V.

Final seed: NOISREVHM

After N:

8 | 15 | 11 | 10 | 4 |

53 | 7 | 23 | 30 | 3 |

25 | 33 | 34 | 1 | 2 |

12 | 9 | 48 | 13 | 26 |

21 | 40 | 27 | 16 | 5 |

8 | 15 | 11 | 10 | 4 |

53 | 7 | 23 | 30 | 3 |

25 | 33 | 34 | 1 | 2 |

12 | 9 | 48 | 13 | 26 |

21 | 40 | 27 | 16 | 5 |

After N + S:

35 | 9 | 16 | 12 | 11 |

26 | 54 | 8 | 24 | 5 |

13 | 10 | 34 | 31 | 4 |

22 | 49 | 14 | 2 | 3 |

41 | 28 | 17 | 6 | 27 |

35 | 9 | 16 | 12 | 11 |

26 | 54 | 8 | 24 | 5 |

13 | 10 | 34 | 31 | 4 |

22 | 49 | 14 | 2 | 3 |

41 | 28 | 17 | 6 | 27 |

After N + S + V:

35 | 9 | 16 | 12 | 11 |

54 | 8 | 24 | 5 | 26 |

34 | 31 | 4 | 13 | 10 |

49 | 14 | 2 | 3 | 22 |

41 | 28 | 17 | 6 | 27 |

35 | 9 | 16 | 12 | 11 |

54 | 8 | 24 | 5 | 26 |

34 | 31 | 4 | 13 | 10 |

49 | 14 | 2 | 3 | 22 |

41 | 28 | 17 | 6 | 27 |

Entering seed NOISREVHM into the site gives

WIN! You consider the importance of looking back on how you got here.

"Looking back" is a hint to reverse the seed, giving MH VERSION.

This is a pointer to Mystery Hunt Bingo, which supports taking a seed as input. Using seed NOISREVHM on Mystery Hunt Bingo gives the following grid.

Puzzle where teams must create a music video. | Puzzle about Magic: the Gathering. | Puzzle about a webcomic. | Puzzle about Taylor Swift. | Puzzle is a Konundrum. |

Puzzle whose crucial step is realizing it matches an MIT landmark. | Puzzle uses grad-level math or higher. | Something given at the start of Hunt is a puzzle. | No errata is issued during Hunt. | Puzzle where anagramming is part of the intended solution. |

Puzzle references previous Mystery Hunts. | Puzzle requires playing out a board game. | FREE SQUARE: "This is not a puzzle." | Puzzle uses a video game released in the past 2 years. | Puzzle uses element symbols. |

Multiple teams are on the final runaround simultaneously. | A puzzle is part of at least two metapuzzles. | Hunt is won on Monday (Eastern time zone). | First meta is solved in the first 2 hours. | Puzzle involves playing a video game. |

Puzzle which has the phrase HERRING or RED HERRING | First puzzle is solved in the first 10 minutes, | Puzzle uses a TV show that stopped airing before 1990. | Puzzle uses an anime that started airing in the past 2 years. | Hunt is won before Sunday (Eastern time zone). |

Index into each square with the numbers from our bingo grid to get the letters

D | O | C | T | O |

R | S | T | R | A |

N | G | E | I | S |

Y | O | U | R | A |

N | S | W | E | R |

D | O | C | T | O |

R | S | T | R | A |

N | G | E | I | S |

Y | O | U | R | A |

N | S | W | E | R |

The answer is **DOCTOR STRANGE**.