Problem 4: Texas Hold 'Em
Grading criteria: correctness of code, to be judged as if your solution to problem 3 is completely correct.
Problem 4: Texas Hold 'Em Grading criteria: correctness of code, to be judged as if your solution to problem 3 is completely correct. Texas Hold 'Em is the variety of poker most often shown on television. Each player is initially dealt two cards (kept hidden), and eventually five more cards are dealt (face up) on the table. Each player's holding is ranked according to the best hand that can be made from their two cards plus the five common cards. (The bidding aspect of the game is not relevant for this problem.) 3a. Write a function which, given a set of seven distinct cards, identifies the highest-ranking hand which can be made using some five of the cards. In case of a tie, you may return any hand which ties for the highest ranking. In 3b. Write a function which, given two pairs of cards, computes the probability that for a random set of five common cards (where all nine cards in question are distinct), the first pair will outrank the second pair. For full credit, you should do this by exhausting over all possibilities for the common cards, rather than doing a random sample. In t 1 3c. Write a function, given one pair of distinct cards, computes the probability that if one chooses another pair and five common cards at random from the remaining cards (so again all nine cards in question are distinct), the given pair will outrank the other pair. For this problem, instead of exhaustion, use 106 random samples. In 1 3d. Determine the values of the function you wrote in 3c for all possible pairs of distinct tards. Note that this probability should depend only on the values of the two cards and (if the values are distinct) whether the two cards are of the same or different suits In Problem 4: Texas Hold 'Em Grading criteria: correctness of code, to be judged as if your solution to problem 3 is completely correct. Texas Hold 'Em is the variety of poker most often shown on television. Each player is initially dealt two cards (kept hidden), and eventually five more cards are dealt (face up) on the table. Each player's holding is ranked according to the best hand that can be made from their two cards plus the five common cards. (The bidding aspect of the game is not relevant for this problem.) 3a. Write a function which, given a set of seven distinct cards, identifies the highest-ranking hand which can be made using some five of the cards. In case of a tie, you may return any hand which ties for the highest ranking. In 3b. Write a function which, given two pairs of cards, computes the probability that for a random set of five common cards (where all nine cards in question are distinct), the first pair will outrank the second pair. For full credit, you should do this by exhausting over all possibilities for the common cards, rather than doing a random sample. In t 1 3c. Write a function, given one pair of distinct cards, computes the probability that if one chooses another pair and five common cards at random from the remaining cards (so again all nine cards in question are distinct), the given pair will outrank the other pair. For this problem, instead of exhaustion, use 106 random samples. In 1 3d. Determine the values of the function you wrote in 3c for all possible pairs of distinct tards. Note that this probability should depend only on the values of the two cards and (if the values are distinct) whether the two cards are of the same or different suits In
