[djames]

[ QUOTE ]
Ok, I can't stand to see incorrect answers posted, even though I maintain that this is a poor thought experiment since playing-UTG-against-cheating-idiots is so different from poker.

[/ QUOTE ]

Please show me the error of my ways!?!?

Oh, and why resort to unnecessary recursion when the closed form answer for any n is so easy to compute?

Also, at n=17, your results show that you expect to win chips after the game. This shouldn't be possible. That is there shouldn't be a chip stack beyond which you turn from being a loser on average to a winner on average. Can you explain these counterintuitive results of yours (with a less arrogant tone)?

Another clue your results aren't correct. Notice that you expect to gain 755 chips with a starting stack of n=1000. However, even if you pushed every single hand and won, you could only obtain 2008 chips. How in the world can you rationalize your results to be correct here given that you will never come close to pushing every hand!?!? No chance you on average increase your stack 75% against 9 players all covering you!

Thanks.

[ QUOTE ]

n value(n)
------------
1 1
2 1.882862
3 2.755967
4 3.640068
5 4.542981
6 5.467867
7 6.415821
8 7.386923
9 8.380731
10 9.396536
11 10.433498
12 11.490724
13 12.567311
14 13.662373
15 14.775055
16 15.904540
17 17.050054
100 136.900389
1000 1755.195048

[/ QUOTE ]