No animals are hurt or otherwise offended in the course of this game!
This game was mentioned in some archaic book, "Games for Programmable Calculator" or something like this. You are encouraged to program game itself (which won't take much time) and play against it yourself first.
The problem is "interactive" so please use instruction on interactive problems -
and particularly the server url from there. GAME-NAME for the url is bear-hunt.
The game is played in a forest, represented by rectangular grid 100*100. Here is The Bear somewhere.
Bear is initially placed randomly at some cell. With every move you go to any cell you choose (by giving X and Y)
and if the bear is here - you win.
If the bear is not in the chosen cell, two things will happen:
- the bear may move to some adjacent cell - i.e. change its location no more than
1cell in bothXandY; - you'll get hint from
radar- it tells whether the bear is to north or south, west or east of you (note, this happens after the bear's move).
You travel using lightning-fast hovercopter so you can try any other cell in the forest every next move (even
if it is on the far side from you). But this innovative machine has energy only for 13 moves.
Technical details
To start, send the token, as usually:
token: ABC...XYZ
If all is correct, server will report the game is initialized:
bear: ready :)
Then on every next move you send coordinates of the cell you wish to investigate:
token: ABC...XYZ
x: 40
y: 87
The server will tell you radar hint and some other info if you missed:
moves: 1
bear: moved
radar: NW
Or, if you have found the bear, note the "victory token":
end: BACD...1357
Copy that token to the answer field and submit (along with your program, presumably).
Refer to the image above to get better understanding of coordinate system and horizon sides.