#51
|
|||
|
|||
Re: Sit N Go Hypothetical
$5s...hes a huge winner
$50s...decent winner $500s...huge loser. |
#52
|
|||
|
|||
Re: Sit N Go Hypothetical
Sit-down-and-play-now Chris, or game-theoretical-maximization-with-study Chris?
If we're talking about giving Chris time to calculate and memorize a strategy for this situation and structure, of course he's going to beat them. He certainly may have lost given a rake (almost certainly at the 500s), but without a rake and against typical opponents, I'm sure the deviation from optimal play at any of those levels is at LEAST as much as Chris gives up by not having other moves in his repertoire. A more interesting question might be: given a set of computers with flawless programming and infinite computational power, and given that 1 of 10 (or 9) computers must push/fold and the rest can pursue a completely optimal strategy WITHOUT the push/fold restriction, how -EV is the push/fold computer? I'm guessing with 10 such computers and 1 with the restriction, the one with the restriction will be -2% ROI or better. (again, assuming no rake) Probably less than that, since effectively, the only reason push/fold can't be as optimal as the other strategies has to do with the granularity of the betting. The difference between a game-theoretical optimal smaller raise, and a game-theoretical optimal push/fold is going to be nothing more than a rounding error when compared to human mistakes. Only when all opponents are playing close to perfectly can it matter. Well, that's how it seems to me, anyhow. Neat question. |
#53
|
|||
|
|||
Re: Sit N Go Hypothetical
well the 500 is a def no. for the 5 and 50 i think he could pull it off
|
|
|