Online Roulette Software With Roulette Winning Secrets

math question?

Construct the tree diagram of the following:
Ali has time to play roulette at most five times. At each play he wins or loses 1 point. He begins with 1 point and will stop playing before the five times if he loses all his points or if he wins 3 points that is, if he has 4 points.
Find the number of ways the betting can occur, and find the number of times he will stop before betting five times.

If you inspect the drawing at:

http://aycu27.webshots.com/image/43266/2005159959603867680_rs.jpg

Each line represents a bet, and each colored
circle represents the state after the bet.
His current number of points are labelled
within each state node. Early termination
nodes are colored red.

Winning bets are the “upward” branch, and
losing bets are the “downward” branch.

You can see that there are 3 paths which
lead to early termination:

1) An initial loss (taking his points to 0)
2) A win, followed by two losses (points=0)
3) 3 consecutive wins (points = 4).

All other combinations of wins and losses
allow him to make the full 5 bets (though
some of them take him to the maximum (4)
or the minimum (0) on that last bet.

There are 11 possible betting combinations:

1) L
2) WLL
3) WLWLL
4) WLWLW
5) WLWWL
6) WLWWW
7) WWLLL
WWLLW
9) WWLWL
10) WWLWW
11) WWW

.