|
|
#11
10-21-2005, 04:53 AM
|
|||
|
|||
Re: Computer simulation problem
So here's what I did in one hour:
2 Type A's and 8 Type B's A's vs. A's: The amount wagered is 1/4 of the smaller stack, unless the difference between the two is greater than a factor of ten, in which case the wager is the entire amount of the smallest stack. A's vs. B's: Same as above, except A's win 60% of the time. B's vs. B's: The wager is the smaller of the two stacks. They start with 20 chips each and go until someone has all 200. Player Type A wins 256/1000 Player Type B wins 744/1000 
|
|
#12
10-21-2005, 05:41 AM
|
|||
|
|||
|
Re: Computer simulation problem
[ QUOTE ]
I'm thinking you have a lot of FlavorBs compared to FlavorAs. What I'm really wondering is, in a big MTT will the slow and steady player ever accumulate enough chips to be in a good position against the luckiest of the luckboxes. [/ QUOTE ] 5000 players enter, only 100 are the world-class "A Players" as you defined, using the same HU confrontation rules I laid out... What I've made is essentially a "blindless" tournament, but with constant wager sizes normalized to the stacks left in play. I played this 100 times and an A Player won it 61 times. That's pretty good for starting with 2% of the field.
|
 |
|
|
Linear Mode
