An "x-y" grid game that I know as "Find Merkle" [M] requires a player [H] to begin at (0,0) and zero in on a hidden co-ordinate location of the creature by nominating one of the 4 cardinal directions and an integer distance. Upon failure to land on that location you are given just one cardinal direction towards that site.
Supposing "Merkle" is hiding at (5,5) and you are at (3,8) after your second play, which was either E3 or N8, you are told E or S, nothing more.

Let us allow two changes to this.
Firstly the player is told to move in one of 8-point compass rose directions.
Secondly, upon failure to capture, "Merkle", having no knowledge of the hunter's location, randomly relocates to any of his immediately adjacent 8 locations except for one if already occupied by the hunter.
- This is exemplified if "H" has been told "SE" and has relocated to (6,5).

Oh, and the hunter only knows "Merkle's" location upon capture. Given that the hunter is astute and multiple games are played, what is the most likely number of moves to capture "Merkle" within an NxN grid?

Steve, Dej Mar.
I've been out for the day and found them.  I need to get ready to go out to dinner.  I shall attempt to address them before I go out otherwise I hope it will be in about 3 hours after this post.

Posted by brianjn on 2012-01-19 02:40:20