Hunt the Wumpus

Hunt the Wumpus is a game you play against the computer on a $10 \times 10$ grid. At the start, four wumpuses are placed randomly on the grid, with no two sharing a square. You must find and capture all four. You guess a square by entering its coordinates as two decimal digits. If your guess is a wumpus, the game tells you so, and that wumpus is captured and removed from the grid. Whether or not you hit a wumpus, the game reports the Manhattan distance between your guess and the nearest remaining wumpus. You use this distance to narrow down where each wumpus is. The game ends when the last wumpus is captured.

You are writing the computer side of the game. A guess or a randomly generated wumpus location is a two-digit number, where the tens digit is $x$ and the ones digit is $y$, giving the point $(x, y)$.

To make the game deterministic, the program uses its own pseudo-random number generator with a given seed $s$. Each random number is produced by first setting $s \leftarrow s + \lfloor s/13 \rfloor + 15$ and then returning the two low digits of $s$. The first four distinct numbers generated are the wumpus locations. For a seed of 132, the first number is the two low digits of $132 + 10 + 15$, which is 57, corresponding to the point $(5, 7)$.

The first line contains a single integer $s$ ($10^4 \le s \le 10^6$), the seed for the random number generator. Each of the remaining lines contains a two-digit number (leading zeros allowed). Each number is one of the player's guesses, corresponding to one grid square.

The input is always well-formed and describes a complete game. The last guess always finds the last wumpus. There are at most 250 guesses.

For each guess, output the computer's response. If the guess hits a wumpus, output You hit a wumpus! on its own line. Whether or not the guess hit, if any wumpuses remain uncaptured, output the Manhattan distance to the nearest remaining wumpus. The Manhattan distance between $(x_1, y_1)$ and $(x_2, y_2)$ is $|x_1 - x_2| + |y_1 - y_2|$, always an integer.

When the game ends, output the total number of moves $m$ needed to locate all the wumpuses in the form Your score is $m$ moves. on its own line.