Zizzling's Poker Theory Game

[marv]

[ QUOTE ]
I have answered this a couple of times already.

Check-raise is allowed.
Each player gets 1 raise.
I don't know how to explain it any clearer than that.


[/ QUOTE ]

Is this essentially your problem (I'm adjusting the ante so all the numbers are integers)?

100 card deck, so 100 is a certain winner and 1 is a certain loser.

Each player antes $1.

Possible betting sequences (ignoring different raise amounts) are:
kk kbf kbc kbrf kbrc bf bc brf brc
where k=check, b=bet, c=call, f=fold, r=raise.

We want the solution to the no-limit problem (where the min legal raise is $1 or the previous raise, whichever is the larger) and where each player has $100 initially before the ante.

Is that it?

Marv

[ QUOTE ]
Each player antes $1.


[/ QUOTE ]
Actually each player antes .50 so that the starting pot = $1. It actually should make no difference at all to the optimal solution either way. I just prefered to make the starting pot size (P$)=1.

[ QUOTE ]
Possible betting sequences (ignoring different raise amounts) are:
kk kbf kbc kbrf kbrc bf bc brf brc
where k=check, b=bet, c=call, f=fold, r=raise.

[/ QUOTE ]
Yes. These are all the possible betting sequences.
The problem children are kbrf, and kbrc (check-raises).

[ QUOTE ]
We want the solution to the no-limit problem (where the min legal raise is $1 or the previous raise, whichever is the larger) and where each player has $100 initially before the ante.


[/ QUOTE ]
I think it is necessary and easier to represent the bet as (%ofpot) rather than a discreet bet amount.

Good luck.