Digitale Medien
Springer
Journal of optimization theory and applications
74 (1992), S. 259-271
ISSN:
1573-2878
Schlagwort(e):
Discrete evasion games
;
time lags
;
value
;
binary trees
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Mathematik
Notizen:
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.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1007/BF00940894
Permalink
Bibliothek |
Standort |
Signatur |
Band/Heft/Jahr |
Verfügbarkeit |