| Abstract: | This article further considers the two‐person continuous ambush game introduced by Ruckle. This article extends the work of Ruckle, Baston and Bostock, and Lee by considering the game for a general number of barriers. By supplanting optimal strategies from a discretized version of the game, we show that there always exists a value for the game, which, furthermore, can be found using linear programming techniques. Further to this, we show that the discrete ambush game considered by Garnaev has the same value as a continuous game, allowing many new results to be obtained in both games. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 515–529, 2003 |
