Ambushing Random Walks I: Finite Models
暂无分享,去创建一个
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.
[1] Alan Washburn,et al. Probability Density of a Moving Particle , 1969, Oper. Res..
[2] Rufus Isaacs,et al. Differential Games , 1965 .
[3] R. D. Arnold. AVOIDANCE IN ONE DIMENSION: A CONTINUOUS-MATRIX GAME , 1962 .
[4] B. McCabe. SEARCHING FOR A ONE-DIMENSIONAL RANDOM WALKER , 1974 .