SOLUTION: Create a tree that models the following scenario. A player decides to play a maximum of 5 times, betting on red each time. The player will quit after losing twice. In the tree, any

Algebra.Com
Question 401525: Create a tree that models the following scenario. A player decides to play a maximum of 5 times, betting on red each time. The player will quit after losing twice. In the tree, any possible last plays will be an ending point of the tree. Branches of the tree should indicate the possibilities of winning or losing, and how that affects whether a new play is made.

Answer by robertb(5830)   (Show Source): You can put this solution on YOUR website!
It's hard to draw trees and branches here, so I'll just list the possibilities:
LL
LWL
LWWL
LWWWL
LWWWW
WLL
WLWL
WLWWL
WLWWW
WWLL
WWLWL
WWLWW
WWWLL
WWWLW
WWWWL
WWWWW

RELATED QUESTIONS

Mr. Z is in a casino for the first time! He decides to play some American roulette.... (answered by Fombitz)
John is in a casino and decides to play some American roulette. First, he bets $1 on red... (answered by Boreal)
A group of 6 friends are playing poker one night, and one of the friends decides to try... (answered by Glaviolette)
Mr. Z is in a casino for the first time! He decides to play some American roulette.... (answered by Fombitz)
f you bet a dollar on a single number on the roulette and that number comes up, you get... (answered by math_helper)
What to do: a. Make a diagram of the situation. b. Plot the number of t-shirt sell,... (answered by josgarithmetic)
Pedro decides to draw a line through the points (1,2) and (4,7). Create an equation for... (answered by stanbon)
Two friends A and B play a checkers match which will end when one player has won three... (answered by robertb,ikleyn)
Mr. Z is in a casino for the first time! He decides to play some American roulette.... (answered by ikleyn)