GAME THEORY QUESTION : Consider a state S with position P and player-to-move X. Let Y be the opponent of X. Let Q1 and Q2 be two different but isomorphic positions that X can move to, and let T1 and T2 be the game tree rooted at (Q1, Y ) and (Q2, Y ) respectively. Describe the bijection f : T1 T2 that maps nodes in T1 to nodes in T2. Explain why, when we are analyzing S (say we want to find who wins, or a winning strategy, or the minimax score), we can prune T2 from the game tree