Poker Solutions.

Slides:



Advertisements
Similar presentations
Discrete Probability Rosen 5.1.
Advertisements

Combinatorics & Probability Section 3.4. Which Counting Technique? If the problem involves more than one category, use the Fundamental Principle of Counting.
Combinations Examples
Counting and Gambling Section 4Objectives: Understand how to use the fundamental counting principle to analyze counting problems that occur in gambling.
Jacqueline Wroughton Joseph Nolan Northern Kentucky University.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Midterms 2.Flushes 3.Hellmuth vs. Farha 4.Worst possible beat 5.Jackpot.
Mock Objects. Unit-testing and TDD are challenging They require some effort to: – Write a test for a small functionality – Refactor production code and.
Probability and Casino Games
4/16/2015 MATH 224 – Discrete Mathematics Counting Basic counting techniques are important in many aspects of computer science. For example, consider the.
Chapter 8 Counting Principles: Further Probability Topics Section 8.3 Probability Applications of Counting Principles.
Chapter 13 sec. 3.  Def.  Is an ordering of distinct objects in a straight line. If we select r different objects from a set of n objects and arrange.
Dealer Comm Hand Player makes Ante bet and optional Bonus bet. Five cards are dealt to each player from the shuffler. Five cards are dealt from the shuffler.
Probability – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Probability Reading: Kolman, Section 3.4.
Great Theoretical Ideas in Computer Science.
CSCE 2100: Computing Foundations 1 Combinatorics Tamara Schneider Summer 2013.
Counting Principles The Fundamental Counting Principle: If one event can occur m ways and another can occur n ways, then the number of ways the events.
5.4 Counting Methods Objectives: By the end of this section, I will be able to… 1) Apply the Multiplication Rule for Counting to solve certain counting.
Chapter 3b Counting Rules. Permutations  How many ways can 5 students in a class of 30 be assigned to the front row in the seating chart?  There are.
Combinatorics. If you flip a penny 100 times, how many heads and tales do you expect?
1 Probability Parts of life are uncertain. Using notions of probability provide a way to deal with the uncertainty.
1 Section 5.1 Discrete Probability. 2 LaPlace’s definition of probability Number of successful outcomes divided by the number of possible outcomes This.
Intro to Probability & Games
Discrete Mathematics Lecture 6 Alexander Bukharovich New York University.
Probability Using Permutations and Combinations
1 The game of poker You are given 5 cards (this is 5-card stud poker) The goal is to obtain the best hand you can The possible poker hands are (in increasing.
The Parameterized Poker Squares EAAI NSG Challenge
Permutations and Combinations
1 9/8/2015 MATH 224 – Discrete Mathematics Basic finite probability is given by the formula, where |E| is the number of events and |S| is the total number.
Probability – Models for random phenomena
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Hand in hw4. 2.Review list 3.Tournament 4.Sample problems * Final.
Game Rules Rules define game objects and define allowable actions by the players.
Counting. Techniques for counting Rule 1 Suppose we carry out have a sets A 1, A 2, A 3, … and that any pair are mutually exclusive (i.e. A 1  A 2 =
Mixed arrangements There are five different ways to systematically determine the number of outcomes in a multi stage event: * Write a list of all possibilities.
3.8 Counting Techniques: Combinations. If you are dealt a hand in poker (5 cards), does it matter in which order the cards are dealt to you? A  K  J.
1 Melikyan/DM/Fall09 Discrete Mathematics Ch. 6 Counting and Probability Instructor: Hayk Melikyan Today we will review sections 6.4,
Advanced Mathematics Counting Techniques. Addition Rule Events (tasks) A and B are mutually exclusive (no common elements/outcomes) and n(A) = a, n(B)
6.1 Probability exercises. Def Def: If S is a finite sample space of equally likely outcomes, and E is an event, that is, a subset of S, then the probability.
Counting Subsets of a Set: Combinations Lecture 31 Section 6.4 Wed, Mar 21, 2007.
Probability Permutations and Combinations.  Permutations are known as any arrangement of distinct objects in a particular _________. Permutations order.
Basic Probability Section 7.1. Definitions Sample Space: The set of all possible outcomes in a given experiment or situation Often denoted by S Event:
Homework Homework due now. Reading: relations
Combinations A combination is an unordered collection of distinct elements. To find a combination, the general formula is: Where n is the number of objects.
Counting Subsets of a Set: Combinations Lecture 33 Section 6.4 Tue, Mar 27, 2007.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1. Review list 2.Bayes’ Rule example 3.CLT example 4.Other examples.
Some other set notation We will use the notation to mean that e is an element of A. We will use the notation to mean that e is not an element of A.
Game Procedures Who does what, where, when, and how?
8.6 Counting Principles. Listing Possibilities: Ex 1 Eight pieces of paper are numbered from 1 to 8 and placed in a box. One piece of paper is drawn from.
Discrete Math Section 15.3 Solve problems using permutations and combinations Read page Combinations and permutations.
CS Lecture 8 Developing Your Counting Muscles.
MAT 142 Lecture Video Series. Combinatorics and Probability.
L14: Permutations, Combinations and Some Review EECS 203: Discrete Mathematics.
6/9/2016MATH 106, Section 51 Section 5 Combinations Questions about homework? Submit homework!
Texas Holdem A Poker Variant vs. Flop TurnRiver. How to Play Everyone is dealt 2 cards face down (Hole Cards) 5 Community Cards Best 5-Card Hand Wins.
Week 9 - Friday.  What did we talk about last time?  Permutations  Counting elements in sets  Brief introduction to combinations.
Warm up How many ways can 8 children be placed on a 8- horse Merry-Go-Round? 7! = What if Simone insisted on riding the red horse? Here we are only.
Probability Intro. Coin toss u Toss two coins 10 times keeping track of the results (head/tails) u Now toss 3 coins 10 times u Make a chart of all the.
MAT 142 Lecture Video Series
Sequential Placement Optimization Games: Poker Squares, Word Squares, and Take It Easy! Todd W. Neller Abstract: In this talk, we teach how to play “Poker.
Unit 4 – Combinatorics and Probability Section 4
Discrete Math Section 15.3 Solve problems using permutations and combinations Read page Combinations and permutations.
Probability of casino games
Discrete Math for CS CMPSC 360 LECTURE 27 Last time: Counting.
Mathematics for Computer Science MIT 6.042J/18.062J
How to Count Things “There are three kinds of people in the world: those who can count and those who cannot.” 11/21/2018.
Combinations Lesson 4.7.
Permutation – The number of ways to ARRANGE ‘n’ items ‘r’ at
Combinations.
Term Project: Poker Game
Section 6.4 Counting and Combinations with Multiple Cases
Counting and Probability
Presentation transcript:

Poker Solutions

How Many Hands are Possible? All of these problems will have a numerator which is the number of ways to form the hand of interest. The denominator will always be the number of ways to form any five card hand Order does not matter, so we use combination We are choosing 5 things from a universe of 52, so evaluate 52C5 to get the denominator which turns out to be 2,598,960

One Pair How many ways can you form exactly one pair from a deck of cards? Choose one of 13 denominations to pair up Within that chosen denomination, choose 2 of the 4 available cards Of the 12 remaining denominations, choose 3 to get the other cards in the hand This ensures that we don’t accidentally get two pairs or some higher hand Within each of those 3 chosen denominations, choose one of the 4 available cards So the numerator is: 13C1 x 4C2 x 12C3 x 4C1 x 4C1 x 4C1 Dividing by 52C5 gives P(one pair) = .423

Two Pairs Choose two of 13 denominations that will have the pairs. Choose two of the four card in each chosen denomination to form the pairs. Choose one of 11 denominations and one of its four cards to finish the hand. Numerator: 13C2 x 4C2 x 4C2 x 11C1 x 4C1 Divide to get P(two pairs) = .047

Three of a Kind Choose one of 13 denominations and choose 3 of its 4 cards Choose two of the remaining 12 denominations and choose one of four cards from each Numerator: 13C1 x 4C3 x 12C2 x 4C1 x 4C1 Divide to get P(3 of a kind) = .021

Straight The order of the cards (low to high) is 2-3-4-5-6-7-8-9-10-J-Q-K-A The low card of any straight cannot be higher than a 10 So there are 9 denominations possible to start a straight Choose one of the 9 denominations and choose one of its 4 cards Choose one of 4 cards from the next higher denomination Choose one of 4 cards from each of the next 3 higher denominations Numerator: 9C1 x 4C1 x 4C1 x 4C1 x 4C1 x 4C1 Divide to get P(straight) = .0035

Flush Choose one of four suits for the flush Choose 5 of its 13 cards Numerator: 4C1 x 13C5 Divide to get P(flush) = .0020

Full House Is a full house of three 5’s and two 6’s the same as two 5’s and three 6’s? No! The hand with the higher three of a kind would win. That means order matters, so we start with permutation Choose two of the 13 denominations to form the full house. Within the denomination that will use 3 of a kind, choose 3 of its 4 cards (and order does not matter) Within the denomination that will use 2 of a kind, choose 2 of its 4 cards. Numerator: 13P2 x 4C3 x 4C2 Divide to get P(full house) = .0014

Four of a Kind Choose one of 13 denominations and use all 4 cards Choose one of 12 remaining denominations and choose one of its 4 cards Numerator: 13C1 x 4C4 x 12C1 x 4C1 Divide to get P(4 of a kind) = .0002

Straight Flush Choose one of the 4 suits for the flush Choose one of the 9 possible bottom cards to start the straight Numerator: 4C1 x 9C1 Divide to get P(straight flush) = .00001 Note: Some people distinguish between a straight flush and a “royal flush”, which is just a straight flush that goes 10-J-Q-K-A There are only 4 ways to choose the suit, so the probability is 4 / 52C5 = 1.54 x 10-6 This was actually included in the calculation of P(straight flush) above

What About None of the Above? To find the probability of getting a 5 card hand that contains none of the named groupings, just subtract from 1 all of the probabilities we have calculated. The result is that there are 1,179,936 ways to get nothing, and the probability is .454

Summary Hand # of ways Probability One Pair 1,098,240 .4226 Two Pair 123,552 .0475 Three of a Kind 54,912 .0211 Straight 9,216 .0035 Flush 5,148 .0020 Full House 3,744 .0014 Four of a Kind 624 .0002 Straight Flush 36 .00001 Garbage! 1,179,936 .4540