Electronic Resource
Springer
Journal of optimization theory and applications
74 (1992), S. 259-271
ISSN:
1573-2878
Keywords:
Discrete evasion games
;
time lags
;
value
;
binary trees
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract The discrete evasion game with a three-move lag, formulated over thirty years ago, was one of the earliest games with time-lag complications. This game remains unsolved, even though it is well-known that the game has a value. By considering the bomber-battleship duel and by constructing an explicit strategy for the bomber, we bound the value from below as 0.28648. This is believed to be the best lower bound known.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00940894
Permalink
| Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |
