 This language is best illustrated with the above game tree. To this end, interpret the tree as the classic children’s game where one player, A, has to guess in which hand her opponent, E, hides some little token. Once E has hidden the token in, say, her right hand (move \(h_R\)), the guessing player has a winning move de re: she should pick right (\(p_R\)). However, as the token was placed in secret, she may not know that picking right is a winning move: the player has no winning strategy de dicto. This is expressed by: 