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 continuous submarine versus submarine game
โ Scribed by Eric Langford
- Publisher
- John Wiley and Sons
- Year
- 1973
- Tongue
- English
- Weight
- 564 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The article considers a two-person zero-sum game in which the movement of the players is constrained to integer points . . . , -1, 0, 1, . . . of a line L. Initially the searcher (hider) is at point x = 0 (x = d, d > 0). The searcher and the hider perform simple motion on L with maximum speeds w and
Submarine berthing plans reserve mooring locations for inbound U.S. Navy nuclear submarines prior to their port entrance. Once in port, submarines may be shifted to different berthing locations to allow them to better receive services they require or to make way for other shifted vessels. However, s