Ambushing Random Walks II: Continuous Models

Abstract

We consider a two person competitive problem in which a traveler (BLUE) wishes to cross a rectangle in such a way to avoid being ambushed by his adversary (RED) who has placed obstacles within the rectangle. Optimal strategies for BLUE and RED are derived in several cases, and applications of these results are suggested.