Numerical approaches to the 'princess and monster' game on the interval

Rufus Isaacs introduced Princess and Monster games in the final chapter of his classic book. The value of the Princess and Monster game on an interval is as of yet unknown. We present some numerical results to estimate this value.

[1]  Shmuel Gal.  On the optimality of a simple strategy for searching graphs , 2001, Int. J. Game Theory.

[2]  B. McCarl,et al.  Economics , 1870, The Indian medical gazette.

[3]  Steve Alpern,et al.  A mixed-strategy minimax theorem without compactness , 1988 .

[4]  T. Başar,et al.  Dynamic Noncooperative Game Theory , 1982 .

[5]  P. Varaiya,et al.  Differential Games , 1994 .

[6]  P. Hudson.  Search Games , 1982 .

[7]  Geert Jan Olsder,et al.  The ''Princess and Monster'' Game on an Interval , 2008, SIAM J. Control. Optim..

[8]  G. Hexner.  A differential game of incomplete information , 1979 .

[9]  Shmuel Gal,et al.  The theory of search games and rendezvous , 2002, International series in operations research and management science.

[10]  J. V. Howard.  Rendezvous Search on the Interval and the Circle , 1999, Oper. Res..