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
A one-dimensional helicopter-submarine game
โ Scribed by V. J. Baston; F. A. Bostock
- Publisher
- John Wiley and Sons
- Year
- 1989
- Tongue
- English
- Weight
- 608 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
โฆ Synopsis
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. The bombs all have destructive radius R and there is a time lag T between the release of a bomb and the bomb exploding. The searcher gets 1 unit if the hider is destroyed and 0 if he survives. A solution is given for b = 1, and extended to b > 1 when the time lag is small. Various applications of the game are discussed.
๐ SIMILAR VOLUMES
Salt Dampening Problems Solved.--The age old problem of salt's dampening and caking in humid weather has finally been alleviated by the makers of Diamond Crystal Weather-pruf Salt, a proJuct of General Foods. Technicians and scientists achieved this after more than 20 years of experimentation by add