Games and winning strategies

R Back
1995 Information Processing Letters  
ILvo-person games are modeled as specifications in a language with angelic and demonic nondeterminism, and methods of program verification and transformation are used to reason about games. That a given strategy is winning can be proved using a variant of the traditional loop correctness rule. Furthermore, an implementation of the winning strategy can be derived using equivalence transformations.
doi:10.1016/0020-0190(94)00206-e fatcat:sdyqjybhpvfmrjae6c4tsdhvbq