Board-and-card games are those which involve higher level of uncertainty as it includes the probability of getting the right card and the moves made by other players. We look to model such games as Markov Games and find an optimal policy through the Minimax – Q algorithm. This will also be a test for the Minimax – Q algorithm to check how it performs in a situation with multiple goal states.
