Premium
A continuous game of ambush
Author(s) -
Baston V. J.,
Bostock F. A.
Publication year - 1987
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(198710)34:5<645::aid-nav3220340505>3.0.co;2-0
Subject(s) - rectangle , adversary , path (computing) , computer science , mathematical economics , operations research , mathematical optimization , mathematics , computer security , geometry , programming language
The article considers a two‐person competitive problem in which a traveller wishes to choose a path across a rectangle from left to right in such a way as to avoid being ambushed by his adversary who has placed obstacles within the rectangle. Our results supplement those that have already been obtained by Ruckle and they indicate that, under certain conditions, the players need to adopt rather sophisticated strategies if they are to act optimally. This suggests that a complete solution to the problem could be difficult.