 No miracles and perfect recall are typical assumptions for most types of agents in game theory. However, certain scenarios require modifications, (cf. Osborne &amp; Rubinstein 1994 on the ‘drunken driver’ scenario). Moreover, if players are represented as finite automata, (cf.  Section 3.8),  perfect recall fails, and quite different patterns of uncertainty become possible. Characterizations results for memory-free and memory-bounded players can be found in Liu (2011).