The article considers a two-person zero-sum game in which a searcher with b bombs wishes to destroy a mobile hider. The players are restricted to move on a straight line with maximum speeds v and u satisfying v > u > 0; neither player can see the other but each knows the other's initial position. Th
A one-dimensional infiltration game
โ Scribed by S. P. Lalley
- Publisher
- John Wiley and Sons
- Year
- 1988
- Tongue
- English
- Weight
- 266 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Starting from a safe base, an Infiltrator tries to reach a sensitive zone within a given time limit without being detected by a Guard. The Infiltrator can move with speed at most u , while the Guard can only perform a restricted number of searches. A discrete variant of this zero-sum game played on
## Abstract This paper is a continuation of previous research, which obtained a convenient solution for arbitrary surface fluxes before ponding. By means of Fourier Transformation this has been extended to derive analytical solutions of a linearized Richards' equation for arbitrary input fluxes aft