Games with Unknown Past
Bakhadyr Khoussainov, Alexander Yakhnis, Vladimir Yakhnis · Mathematical logic quarterly · 1998
Abstract We define a new type of two player game occurring on a tree. The tree may have no root and may have arbitrary degrees of nodes. These games extend the class of games considered by Gurevich‐Harrington in [5]. We prove that in the game one of the players has a winning strategy which depends onfinite bounded information about the pastpart of a play and on future of each play that isisomorphism typesof tree nodes. This result extends further the Gurevich‐Harrington determinacy theorem from [5].