Tom: Well that’s a lot better than we usually do

Slides:



Advertisements
Similar presentations
Copyright © 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 18 Sampling Distribution Models.
Advertisements

Copyright © 2010, 2007, 2004 Pearson Education, Inc. Chapter 18 Sampling Distribution Models.
Copyright © 2010, 2007, 2004 Pearson Education, Inc. Chapter 18 Sampling Distribution Models.
A Sampling Distribution
Lecture 3 Outline: Thurs, Sept 11 Chapters Probability model for 2-group randomized experiment Randomization test p-value Probability model for.
Simulation Operations -- Prof. Juran.
Session 7a. Decision Models -- Prof. Juran2 Overview Monte Carlo Simulation –Basic concepts and history Excel Tricks –RAND(), IF, Boolean Crystal Ball.
Magic: the Gathering How to play.. I.Intro II.How to Lose III.The Colors IV.Card types V.Special abilities VI.“The Stack” VII.Turn order VIII. Combat.
Hypothesis testing and parameter estimation Bhuvan Urgaonkar “Empirical methods in AI” by P. Cohen.
6-1 Stats Unit 6 Sampling Distributions and Statistical Inference - 1 FPP Chapters 16-18, 20-21, 23 The Law of Averages (Ch 16) Box Models (Ch 16) Sampling.
Theoretical Probability Distributions We have talked about the idea of frequency distributions as a way to see what is happening with our data. We have.
Games of probability What are my chances?. Roll a single die (6 faces). –What is the probability of each number showing on top? Activity 1: Simple probability:
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 15 Chances, Probabilities, and Odds 15.1Random Experiments and.
Copyright © 2010 Pearson Education, Inc. Chapter 18 Sampling Distribution Models.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 16 Mathematics of Normal Distributions 16.1Approximately Normal.
Maximum Likelihood. Likelihood The likelihood is the probability of the data given the model.
Copyright © 2006 Pearson Addison-Wesley. All rights reserved. Lecture 4: Mathematical Tools for Econometrics Statistical Appendix (Chapter 3.1–3.2)
1 Probability Parts of life are uncertain. Using notions of probability provide a way to deal with the uncertainty.
Simulation.
Math 3680 Lecture #11 The Central Limit Theorem for Sample Counts and Sample Proportions.
The Financial Survival Guide to Retirement Retirement Basics.
Random Variables A random variable A variable (usually x ) that has a single numerical value (determined by chance) for each outcome of an experiment A.
Section 6.3: Binomial and Geometric Random Variables
Probability Models Chapter 17.
A Collectable Card Game David Lam Stanford SPLASH! November 3, 2012.
CSCE 2100: Computing Foundations 1 Probability Theory Tamara Schneider Summer 2013.
A Sampling Distribution
Approximation and Nested Problem. Four players are playing a poker game out of a deck of 52 cards. Each player has 13 cards. Let X be the number of Kings.
Bootstrapping (And other statistical trickery). Reminder Of What We Do In Statistics Null Hypothesis Statistical Test Logic – Assume that the “no effect”
Chapter 4 Probability Distributions
Section 8.1 Estimating  When  is Known In this section, we develop techniques for estimating the population mean μ using sample data. We assume that.
Sometimes we can tell how people are feeling by looking at them. How are they feeling?
Learning to Play KardKuro Goals: Have Fun while Practicing Addition and Subtraction. Improve Social Learning Opportunities with Classmates. Become familiar.
Rule of sample proportions IF:1.There is a population proportion of interest 2.We have a random sample from the population 3.The sample is large enough.
Random Numbers and Simulation  Generating truly random numbers is not possible Programs have been developed to generate pseudo-random numbers Programs.
What Do You Expect D. Brooke Hill & Rose Sinicrope East Carolina University , Thursday, 31 October 2013 NCCTM 43 rd Annual Conference Auditorium.
Copyright © 2009 Pearson Education, Inc. Chapter 18 Sampling Distribution Models.
1 Chapter 18 Sampling Distribution Models. 2 Suppose we had a barrel of jelly beans … this barrel has 75% red jelly beans and 25% blue jelly beans.
©2009, Tom McKendree Biplanes ©2009, Tom McKendree.
Expected Value. Expected Value - Definition The mean (average) of a random variable.
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 18 Sampling Distribution Models.
Sampling Distribution Models Chapter 18. Toss a penny 20 times and record the number of heads. Calculate the proportion of heads & mark it on the dot.
7.2 Means and variances of Random Variables (weighted average) Mean of a sample is X bar, Mean of a probability distribution is μ.
What is a Random Sample (and what if its not) ©Dr. B. C. Paul 2005.
 The point estimators of population parameters ( and in our case) are random variables and they follow a normal distribution. Their expected values are.
Geometric and Hyper-geometric Distribution. Geometric Random Variable  Take a fair coin and toss it as many times as needed until you observe a head.
Probability What are the chances?.
AP Statistics, Section 7.2, Part 1 2  The Michigan Daily Game you pick a 3 digit number and win $500 if your number matches the number drawn. AP Statistics,
Week 6. Statistics etc. GRS LX 865 Topics in Linguistics.
By Kevin Sandhu. Pick a Deck 5 decks to choose from Each player gets 20 life points Each player cuts the others deck Untap all cards at beginning Draw.
Introduction Lecture 25 Section 6.1 Wed, Mar 22, 2006.
GamblingGambling What are the odds? Jessica Judd.
Section 7.2 P1 Means and Variances of Random Variables AP Statistics.
What is the probability of picking an ace? Probability =
Chapter 18 Sampling distribution models math2200.
Stat 31, Section 1, Last Time Big Rules of Probability –The not rule –The or rule –The and rule P{A & B} = P{A|B}P{B} = P{B|A}P{A} Bayes Rule (turn around.
Deckbuilding Basics Kevin: I’m glad we got 35 decks built Tom: I’m glad I got this powerpoint done Kevin: I’m glad I have my voice back Tom: I’m glad you.
Warm Up 1. The probability of getting the numbers 1,2,3,4 out of hat are 3/8, 3/8,1/8,1/8. Construct a probability distribution (table) for the data and.
Stat 35b: Introduction to Probability with Applications to Poker Outline for the day: 1.Expected value. 2.Heads up with AA. 3.Heads up with Gus vs.
Copyright © 2010, 2007, 2004 Pearson Education, Inc. Chapter 18 Sampling Distribution Models.
Chance We will base on the frequency theory to study chances (or probability).
Chapter 7: Random Variables 7.2 – Means and Variance of Random Variables.
The Law of Averages. What does the law of average say? We know that, from the definition of probability, in the long run the frequency of some event will.
MONTE CARLO SIMULATION MODEL. Monte carlo simulation model Computer based technique length frequency samples are used for the model. In addition randomly.
Statistics 18 Sampling Distribution. The Central Limit Theorem for Sample Proportions Rather than showing real repeated samples, imagine what would happen.
Sampling Distribution Models
Stat 100 Feb. 18.
Means and Variances of Random Variables
Random Variables Binomial Distributions
Counting and Probability
Presentation transcript:

Tom: Well that’s a lot better than we usually do Statistics Kevin: I’m coming up with 32.33%, uh, repeating of course, percentage of survival Tom: Well that’s a lot better than we usually do

Where does stats matter? Statistics and combinatorics has a deep history in gambling Magic cards are just like playing cards as far as ordering Deal mostly with combinatorics

Important questions in Magic How many lands are you going to hit in your opening hand? Why do most decks stay around 36 creatures and 24 spells? Why do most decks have exactly 60 cards? fix slide

Why do most decks have exactly 60 cards? Pretty simple – you want to draw you best spells Assuming we have a absolutely randomized deck x copies of Baneslayer Angel, y cards trying to maximize x/y That’s easy

Why do most decks stay around 36 spells and 24 lands? true: you can only play 1 land a turn generally true: more expensive spells are better generally true: you want to draw just enough lands to play all of your spells

I want a deck named after me… 2 Dwarven Trader 2 Goblin of the Flarg 4 Ironclaw Orcs 3 Dwarven Lieutenant 2 Orcish Librarian 2 Brothers of Fire 2 Orcish Artillery 2 Orcish Cannoneers 2 Dragon Whelp 4 Lightning Bolt 4 Incinerate 1 Fireball 1 Immolation 1 Shatter 1 Detonate 4 Brass Man 1 Black Vise 4 Strip Mine 4 Mishra’s Factory 2 Dwarven Ruins 13 Mountain Piloted by Paul Sligh at PT Atlanta ’96 Made Semis During the Black Summer But this deck is bad

It’s really bad It has an anti-combo in it So how did it beat the ridiculous card advantage of necropotence?

The mana curve* 1 mana slot: 9-13 2 mana slot: 6-8 3 mana slot: 3-5 X spell: 2-3 Lightning bolt (critter kills): 8-10 mana 23-26 15-17 of color *according to Jay Schneider

Guess the deck

So how many lands do you need? 24 is standard 24 * (10 / 60) = 4 lands by turn 4 Might scale downward as low as 20 for aggro 20 * (10 / 60) = 3 lands by turn 3 Might go up to 27 for control decks card drawing nets you extra cards 7 card opening and 2 draw spells 27 * (17 / 60) = 7.65 lands by turn 7 fix math

How to search for creatures?

The Setup Y creatures left in your deck Z cards left in your deck (assume 50 from now on) Expected number of creatures revealed by both?

Commune with Nature Regardless of creatures revealed, you only get 1 P(X > 0) Equivalent to 1 – P(X > 0c) or 1 – P(X = 0)

Combinations Combinations are the number of ways that k elements can be taken from a set of n elements Combinations are unordered

How combinations work I’m a cheap-ass when it comes to ordering pizza 25 (n) different toppings, choose 3 (k) of them 25 * 24 * 23 different ways to choose an ordered set of them, or n! / (n-k)! don’t care about order, and k! ways to order So 2300 different pizzas

The math Number of combinations of picking non-creature P(X > 0) = Total combinations So if you have, say, 20 creatures left P(X > 0) = = so we have an expected value of about .93 with 20 creatures

Beast Hunt Scales from 0 to 3 creatures, each of which has a different probability of happening P(X = j) = E(X) = P(X = 0) * 0 + P(X = 1) * 1 + P(X = 2) * 2 + P(X = 3) 3 j needs to be an i For 20 creatures left E(X) = 29/140 * 0 + 87/196 * 1 + 57/196 * 2 + 57/980 * 3 = 1.2

The distribution Drawing cards is a hypergeometric distribution k = successes observed creatures drawn m = successes possible creatures in deck N = size of the population deck size n = draws

Do you mulligan 1-landers? Let’s say that a victory is drawing 3-4 lands in your first 4 turns Less and you’re screwed More and you’re flooded Assume we have a standard 24 land, 60 card deck

Assume you’re going first

Victory with the 1 lander P(X = 3) + P(X = 4) you draw 3 more cards by turn 4 k = 2, m = 23, N = 53, n = 3 P(X = 3) = = .324 k = 3, m = 23, N = 53, n = 3 P(X = 4) = = .076 so about 40% of drawing out of it

Victory with a mulligan P(X = 3) + P(X = 4) you draw 6 + 3 more cards by turn 4 k = 3, m = 24, N = 60, n = 9 P(X = 3) = = .267 k = 4, m = 24, N = 60, n = 9 P(X = 4) = = .271 so about 55% of a good hand That’s better

Assume you’re going second

Victory with the 1 lander P(X = 3) + P(X = 4) You draw 4 cards by turn 4 k = 2, m = 23, N = 53, n = 4 P(X = 3) = = .375 k = 3, m = 23, N = 53, n = 4 P(X = 4) = = .181 so about 55% of drawing out

Victory with a mulligan P(X = 3) + P(X = 4) you draw 6 + 4 more cards by turn 4 k = 3, m = 24, N = 60, n = 10 P(X = 3) = = .224 k = 4, m = 24, N = 60, n = 0 P(X = 4) = = .274 so about 49.8% chance of getting enough lands

Monte Carlo Simulations Monte Carlo simulations approximate something by repeated sampling Often used for problems without closed forms with absurdly complicated closed forms Magic games are definitely the latter How can we use the Monte Carlo method?

How can we use the Monte Carlo method?

How do you goldfish? Goldfishing is just drawing hands to see how a deck does Good way to see how a deck curves Also tells you how fast a deck is Hulk Flash could win turn .5 Goblins can win turn 3 Playtesting is essential Can we quantify that?

How do these go together? Monte Carlo simulations can run millions of games in seconds Can be scaled upwards to determine how games go Or can be as simple as finding combo pieces

Cascade Swans Parth Modi, Regionals 2009 42 Lands (of various types) 4 Bloodbraid Elf 4 Swans of Bryn Argoll 4 Seismic Assault 4 Bituminous Blast 2 Ad Nauseam + = massive card drawing

Other cards

Let’s simulate

Some results probability mass function over 100000 runs Assuming Ad Nauseam and Cascade are dead cards and do nothing Cascade works, but Ad Nauseam doesn’t Both work, and Bloodbraid Elf is preferred to be played before Bituminous Blast and Both work, and Blast before Elf

Seen differently Cumulative distribution function ~24% on turn 4

It’s not perfect Like any model, it’s missing a lot Just goldfishing Assume that swans + assault is a win No mulligans Ad Nauseam is done on life total Didn’t account for colors