Ambushing Random Walks I: Finite Models

William Ruckle, Robert Fennell, Paul T. Holmes and Charles Fennemore
Additional contact information
William Ruckle: Clemson University, Clemson, South Carolina
Robert Fennell: Clemson University, Clemson, South Carolina
Paul T. Holmes: Clemson University, Clemson, South Carolina
Charles Fennemore: Clemson University, Clemson, South Carolina

Operations Research, 1976, vol. 24, issue 2, 314-324

Abstract: We consider a two-person competitive problem in which one player ( blue ) wishes to move across a rectangular lattice in such a way as to avoid being ambushed by his opponent ( red ), who has placed obstacles in blue 's path. Under some conditions, optimal strategies for blue and red are obtained and the value of the game is computed.

Date: 1976
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.24.2.314 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:24:y:1976:i:2:p:314-324

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().