BRIDGE AND PROBABILITY. Aims Bridge 1) Introduction to Bridge Probability 2) Number of Bridge hands 3) Odds against a Yarborough 4) Prior probabilities:

Slides:



Advertisements
Similar presentations
Natalia Sivackova. Events that cannot happen together (e.g. cant a card that is both red and black in a card deck) P(A B) = P(A) + P(B)
Advertisements

6 Spades in South 23 hcpts Bidding: W: 1H N: 2H E: pass S: ?? North: S: A H: D: K C: 8 South: S: Q 10 4 H: 3 D: A Q J 3 C: A K 5 4.
6 Hearts in North North: S: A 9 4 H: A J 10 5 D: A 5 C: K South: S: K 8 H: K Q D: Q C: A 3 IMPs 29 hcpts Bidding: N: 1N S: 2D N: 3H S:
Aim: What are ‘Or’ Probabilities?
Bellwork You roll a fair die one time, find each probability below.
What are your Chances? by Laurie Townsend.
Discrete Probability Rosen 5.1.
Beginning Probability
1 Combination Symbols A supplement to Greenleafs QR Text Compiled by Samuel Marateck ©2009.
Minibridge Cowbridge Comprehensive July 2007 Patrick Jourdain.
Chapter 4 Basic Probability
Lecture 18 Dr. MUMTAZ AHMED MTH 161: Introduction To Statistics.
Probability Probability Principles of EngineeringTM
500 for 2 Enjoy your favourite card game with only 2 players 500 for 2
Bridge with Harold Schogger © SUIT PREFERENCE SIGNALS.
An Extra Point Quiz. Are You Smarter than a Pre-Calc Student is a game in which the first 10 questions the class is playing the game together to earn.
Probability: Mutually Exclusive Events 1. There are 3 red, 4 black and 5 blue cubes in a bag. A cube is selected at random. What is the probability of.
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.
A GUIDE TO RUBBER CONTRACT BRIDGE FOR BEGINNERS By Greg Peacock.
MAT 103 Probability In this chapter, we will study the topic of probability which is used in many different areas including insurance, science, marketing,
Business and Economics 6th Edition
1 Combinations & Counting II Samuel Marateck © 2009.
{ 11.3 Dependent Events Apply probability concepts such as intersections, unions and complements of events, and conditional probability and independence,
Bridge with Harold Schogger © Opening Leads. Bridge with Harold Schogger © Blind Opening Leads Against Suit contracts 1. TOP of Sequence So if I lead.
Beginners Lesson 16 Declarer Play in No Trumps. Declarer Play in NT The Auction is complete The opening lead is made Dummy goes down Is it the right contract?
Whiteboardmaths.com © 2004 All rights reserved
Quit Introduction Cards Combining Probabilities.
We - J&HThey - M&A We begin with a blank sheet of paper set out like the example to the left.
Bridge for Beginners Lesson 2 More about MiniBridge.
Lesson 13: Tricks from small cards Surendra Mehta March 2007.
1 Bridge for Scholars 2009 Presentation 01 2 The deck The deck has 52 cards There are four suits: Clubs , Diamonds , Hearts, Spades  The lowest card.
Playing and defending NO TRUMP CONTRACTS. Playing the contract STOP! Review dummy and your hand How many tricks can you count? Do you have a problem suit?
Mckenney Discards Bridge with Harold Schogger ©. © Partner leads the  J and you have to discard. What to do ? If you throw a High Heart you have thrown.
Bridge for Beginners Lesson 3 Declarer Play. Homework from Week 2 1Chris Game in 10 2Bill Part score in 11 2Bill Part score in  11 3Bill Game in NT 8.
Declarer Play – General Principles Pause before Playing your first card Count your winners and losers Dangers (bad breaks, defence winners off the top.
The Game of Ombre Canto 3; lines At the Hampton Palace.
Class notes for ISE 201 San Jose State University
Fundamentals of Probability
Jim Berglund’s Bridge Lesson 3
15.3 Counting Methods: Combinations ©2002 by R. Villar All Rights Reserved.
What is the Purpose of This Class
Pitch Playing Agent Project for Into to AI Jody Ammeter.
Surendra Mehta, March NAVNAT BRIDGE CLUB WEDNESDAY GROUP Surendra Mehta March 2007.
Using your Resources 1. Defense: standard Carding 2. Discarding losers 3. Entries 4. Developing long suits in dummy.
Bridge with Harold Schogger © Blackwood & Roman Key Card Blackwood.
Essential Techniques To Play Better Bridge. To play better Bridge a partnership must do the following: Play a sound bridge system that each player knows.
Machine Learning of Bridge Bidding By Dan Emmons Computer Systems Laboratory
Rules for Mini Bridge Lesson 5 Place board correct orientation (NSEW) Count cards (face down) Sort hand Count points Dealer to announce point count Clockwise.
S 04 Making a Plan BRIDGE FOR SCHOLARS JANUARY 2016.
1 BEGINNERS’ LESSONS Welcome Teacher: Your Name Here Telephone: © Copyright Reserved New Zealand Bridge Inc Prepared.
1 BEGINNERS’ LESSONS Welcome Teacher: Your Name Here Telephone: © Copyright Reserved New Zealand Bridge Inc Prepared.
1 BEGINNERS’ LESSONS Welcome Teacher: Your Name Here Telephone: © Copyright Reserved New Zealand Bridge Inc Prepared.
Declarer Play – General Principles Pause before Playing your first card Count your winners and losers Dangers (bad breaks, defence winners off the top.
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.
Virtual University of Pakistan Lecture No. 18 of the course on Statistics and Probability by Miss Saleha Naghmi Habibullah.
The play of the cards: suit contracts Trumps or no trumps? Trumps or no trumps? The value of trumps The value of trumps When to draw trumps When to draw.
BEGINNERS’ LESSONS Welcome
IMPROVERS’ LESSONS Welcome
IMPROVERS’ LESSONS Welcome
BEGINNERS’ LESSONS Welcome
BEGINNERS’ LESSONS Welcome
@NAMEOFEVENTORBRIDGECLUB
IMPROVERS’ LESSONS Welcome
Development and Implementation of a Machine Bridge Bidding Algorithm
Hand evaluation Bridge lecture – intermediate by Milan Macura
IMPROVERS’ LESSONS Welcome
BEGINNERS’ LESSONS Welcome
The Five Lines of Defense
Presentation transcript:

BRIDGE AND PROBABILITY

Aims Bridge 1) Introduction to Bridge Probability 2) Number of Bridge hands 3) Odds against a Yarborough 4) Prior probabilities: Suit-Splits and Finesse 5) Combining probabilities: Suit-Splits and Finesse 6) Posterior probabilities: Suit-Splits

1) Introduction to Bridge – The Basics Partnership game with 4 players N W E S 13 cards each

Introduction to Bridge - The Auction Bidding boxes Declarer, Dummy and the Defenders Bid how many tricks you predict you and your partner can make Bidding Box

Introduction to Bridge - The Play One card played at a time going clockwise Trick : Follow suit Trumps Winner begins the next trick N E S W Dummy hand

2) Number of Bridge hands - The Basics 52 possibilities for the 1st card 51 possibilities for the 2nd card 40 possibilities for the 13th card ………………….. XXX The number of ways you can receive 13 cards from 52 is:

Number of Bridge hands - Combinations Order does not matter Therefore, divide by 13! (or in general r!) n X (n-1) X (n-2) X … X (n - r + 1) r! = n C r = 52 C 13 = 52! = 39!13! 635,013,559,600 ______________________________________________________________________________ ____________________ n! (n- r)! r! ___________________

3) Odds against a Yarborough - The Basics A Yarborough = A hand containing no card higher than a 9 Earl of Yarborough Number of cards no higher than 9 is: X 4 suits 8 in each suit: = 32

Odds against a Yarborough - The Odds Odds against being dealt a Yarborough are P(Yarborough) = Odds against P(Ā) P(A) 32 C C 13 ___________________ Note P(Ā) = complement of A = P(not A) 1827 to 1

4.1) Prior Probabilities – Suit-split Suit split = The division of cards between the 2 defenders in 1 suit P(3-3 split)= 6 C 320 C 10 X 26 C 13 = SplitProbability & & & _________________________________________

4.2) Prior Probabilities - Finesse Dummy N E Declarer S W When East has the King, the Finesse always loses

Dummy N E Declarer S W However, when West has the King, the Finesse always wins When East has the King, the Finesse always loses Prior Probabilities - Finesse

Dummy N E Declarer S W Therefore the Finesse has Probability 0.5 of succeeding However, when West has the King, the Finesse always wins When East has the King, the Finesse always loses Prior Probabilities - Finesse

5) Combining Probabilities - Intersection and Union N E S W SuitDefinite tricksPossible extra tricks Spades1 (Ace)1 (if finesse the Queen) Hearts1 (Ace)0 Diamonds3 (Ace, King, Queen)1 (if defenders have a 3-3 split) Clubs2 (Ace, King)0 Total72 Declarer Dummy

If you bid to make 9 tricks you have to make your 7 definite tricks and both of the possible extra tricks P(9 tricks) = P(Finesse succeeds 3-3 split) = P(Finesse succeeds) X P (3-3 split) = Intersection P(A B) = P(A) x P(B) if A and B are independent Combining Probabilities - Intersection and Union

If you bid to make 8 tricks you have to make your 7 definite tricks and 1of the possible extra tricks P(8 tricks) = P(Finesse succeeds 3-3 split) = P(Finesse succeeds) + P(3-3 split) – ( P(Finesse succeeds) X P(3-3 split) ) = p (A B) Union P(A B) = P(A) + P(B) Note if A and B are mutually exclusive P(A B) = 0 Combining Probabilities - Intersection and Union

6) Posterior Probabilities – Suit-splits Probabilities change with each piece of new information Bayes Theorem: P(A|B) = P(B|A) X P(A) P(B) P(3-3 diamond split | Defenders 2 diamonds each) P(Defenders 2 diamonds each) = P(Defenders 2 diamonds each | 3-3 diamond split) X P(3-3 diamond split) ____________________________________ ______________________________________________________________________________ Partition Theorem: P(B) = P(B|A) X P(A) + P(B|(Ā) X P(Ā)

Posterior Probabilities – Suit-splits = P(Defenders 2 diamonds each | 3-3 split) X P(3-3 split) + P(Defenders 2 diamonds each | 4-2 split) X P(4-2 split) + P(Defenders 2 diamonds each | 5-1 split) X P(5-1 split) + P(Defenders 2 diamonds each | 6-0 split) X P(6-0 split) = P(3-3 diamond split | Defenders 2 diamonds each) = P(Defenders 2 diamonds each) = 1 X ___________________________ = 1 X X X X

Summary Combinations for the: Number of Bridge hands Odds against a Yarborough Prior probabilities of Suit-splits Intersection and Union for the: Combined probabilities of Suit-splits and Finesse Bayes Theorem and Partition Theorem for the: Posterior probability of Suit-splits I used: In my essay I will also use: Decision Theory to analyse the Scoring System Game Theory to analyse Bridge moves