Consider the simplified game of poker where there are exactly two players and three cards, ranked in the following order: Ace beats King and King beats Queen. Each player is dealt one of the three cards, which they view independently. Then the players simultaneously declare whether they are going to wager $1. If both players wager $1, then the player with the higher card takes all the money. If only one player wagers, then that player takes all the money regardless of the cards. If neither player bets, no mey changes hands.

a. Which formalisms would work for this game? 

(a) expect minimax search, 

(b) Greedy search, (c) CSP, 

(d) Minimax search? 

b. Under what conditions would α–β pruning work?