God and the Devil decide to play a game. God will start by picking an infinite sequence of moves of the form "left", "right", "up", and "down". The Devil responds by creating a finite maze with an exit and by placing God somewhere inside. God then follows His preselected sequence to traverse the maze. Unmakable moves are ignored; for example, if the next move is "left" and there is a wall to the left of the current square, God goes on to the next move in the sequence without moving.
If God escapes the maze in finite time, He wins. Otherwise, the Devil wins.
Assuming both agents act optimally, who will win?
(assume that the maze is formed by deleting some edges from a rectangular grid, and that it has no isolated regions; i.e., it is always possible to get to the exit from any point inside the maze)
Is this what needs to be proved?: There exists a sequence of moves such that for evey possible finite maze, this sequence yields a solution.
If so I think I got it.
Consider the set of all mazes that fit inside a 2x2 grid. This is definitely a finite set. Let f(n)= the minimum length of move sequence that solve any nxn maze.
f(2)=finite. I'm not going to find it but it is probably less than 20 because there are only a few 2x2 mazes. (I'm considering the start and end to both be grid squares so there is no 1x1 maze.)
f(n) is just some function of n. If this function could be explicitly found it could be shown that f(n) is finite for any n.
Jer

Posted by Jer
on 20050209 17:09:46 