 In a program format, strategies start with basic actions, representing individual moves in a game tree. From there, complex programs \(\pi\) can be created using operations including sequential compositions \(\pi_{1} \,;\pi_{2}\) (\(\pi_{1}\) is to be performed followed by \(\pi_{2}\)), or choice \(\pi_{1}\, \cup_{i} \pi_{2}\) (agent i is to pick between actions \(\pi_{1}\) and \(\pi_{2}\) ). Moreover, a test operation \(?\varphi\) for checking whether \(\varphi\) holds, enables strategies to react to properties of states or opponents’ past actions. Finally, to describe continuous execution of a strategy along a game tree, it makes sense to have an operation \(\pi^{*}\) of program iteration, stating that \(\pi\) be executed arbitrarily often.