two-person games can also be represented as and-or trees. for the first player to win a game, there must exist a winning move for all moves of the second player. this is represented in the and-or tree by using disjunction to represent the first player's alternative moves and using conjunction to represent all of the second player's moves.