1. Homework 3 (June 7) Material covered: Slides 4.8-6.10
What is a unilegal run of a given game G?
What is a unistructural game?
All constant (0-ary) games, as well as all elementary games, are unistructural. Explain why.
You should be able to reproduce the formal definitions of all game operations seen so far (negation, choice operations, parallel operations).
Consider the game ⊔x⊓y(y≠xx)  ⊓z⊔y(y=z2). Which player wins the empty run   ? How about the run 1.7, 0.7, 0.49, 1.49? How about 1.7, 0.7, 0.49, 0.49? How about 1.7, 0.7, 0.44, 1.33?
From Slide 6.5 we know that the classical tautology A(AA) is not valid in computability logic. But the “similar” tautology A(AA), on the other hand, is valid, meaning that the machine has an (easy) winning strategy for the game Chess(ChessChess). Describe such a strategy.