MHB Probability of winning at least two games in a row - - - Elementary Probability

AI Thread Summary
In a game against two players, A and B, with winning probabilities of 90% and 10% respectively, the discussion focuses on which sequence of games maximizes the chance of winning at least two in a row. Two scenarios are analyzed: starting against player A or player B. The probability of winning two consecutive games is calculated using a contingency tree, revealing that the first scenario yields a probability of 0.09 for winning the first two games. The analysis also considers the probability of losing the first game but winning the next two, which varies based on the chosen sequence. Ultimately, the second scenario is suggested to provide a better chance of achieving the desired outcome.
checkitagain
Messages
137
Reaction score
1
You can play against player A or player B in an all-skill game
(such as chess or checkers).

Suppose there are no ties/draws.

On average you beat player A 90% of the time in this game,
and on average you beat player B 10% in this game.

You will play three games in row, and each game will be
against one player at a time.You will choose one of these scenarios:1st game - - a game against player A
2nd game - - a game against player B
3rd game - - a game against player AOR1st game - - a game against player B
2nd game - - a game against player A
3rd game - - a game against player B-------------------------------------------------------------------------------------Which scenario should you choose to have the greatest
chance of winning at least two games in a row? * *

** This is adapted from a problem presented by Martin Gardner.

 
Mathematics news on Phys.org
checkittwice said:
You can play against player A or player B in an all-skill game
(such as chess or checkers).

Suppose there are no ties/draws.

On average you beat player A 90% of the time in this game,
and on average you beat player B 10% in this game.

You will play three games in row, and each game will be
against one player at a time.You will choose one of these scenarios:1st game - - a game against player A
2nd game - - a game against player B
3rd game - - a game against player AOR1st game - - a game against player B
2nd game - - a game against player A
3rd game - - a game against player B-------------------------------------------------------------------------------------Which scenario should you choose to have the greatest
chance of winning at least two games in a row? * *

** This is adapted from a problem presented by Martin Gardner.



The second.

Construct a contingency tree to investigate further.

In both such trees there is a branch where the first two games are won, this branch occurs with probability \(0.09\) (the outcome of the third game does not effect the probability of winning two games in a row along this branch).

The other main branch involves loseing the first game and winning the remaining two. This occurs with probability \(0.1 \times 0.1 \times 0.9\) in the first case and \(0.9 \times 0.9 \times 0.1\) in the second.CB
 
Thread 'Video on imaginary numbers and some queries'
Hi, I was watching the following video. I found some points confusing. Could you please help me to understand the gaps? Thanks, in advance! Question 1: Around 4:22, the video says the following. So for those mathematicians, negative numbers didn't exist. You could subtract, that is find the difference between two positive quantities, but you couldn't have a negative answer or negative coefficients. Mathematicians were so averse to negative numbers that there was no single quadratic...
Thread 'Unit Circle Double Angle Derivations'
Here I made a terrible mistake of assuming this to be an equilateral triangle and set 2sinx=1 => x=pi/6. Although this did derive the double angle formulas it also led into a terrible mess trying to find all the combinations of sides. I must have been tired and just assumed 6x=180 and 2sinx=1. By that time, I was so mindset that I nearly scolded a person for even saying 90-x. I wonder if this is a case of biased observation that seeks to dis credit me like Jesus of Nazareth since in reality...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
Back
Top