Mazes: Search games on unknown networks
Edward James Anderson · Networks · 1981
Abstract This paper discusses a class of search problems on networks, where the searcher only has information about that part of the network which he has traversed. These problems correspond to that of finding the exit of a maze. In this context it is natural to consider the two person game between the solver and the setter, where the setter may choose the maze subject to a constraint on the total length of its arcs. A particular strategy for the solver is investigated and shown to be optimal for this game.