A minimizing searcher S and a maximizing hider H move at unit speed on a closed interval until the first (capture, or payoff) time that they meet. This zero-sum princess and monster game or less colorfully search game with mobile hider was proposed by Rufus Isaacs for general networks While the existence and finiteness of the value has been established for such games, only the circle network has been solved (value and optimal mixed strategies). It seems that the interval network had not been studied because it was assumed to be trivial, with value and “obvious” searcher mixed strategy going equiprobably from one end to the other. We establish that this game is in fact nontrivial by showing that Using a combination of continuous and discrete mixed strategies for both players, we show that The full solution of this very simple game is still open and appears difficult, though many properties of the optimal strategies are derived here.