| 31. | Sklansky's strategy is an equilibrium strategy in the sense that it is optimal against someone playing an optimal strategy against it.
|
| 32. | As such, it may be an optimal strategy to be slightly forgiving of and have a slightly generous interpretation of non-cooperation.
|
| 33. | Intuitively, zero-regret strategies are guaranteed to converge to a ( not necessarily unique ) optimal strategy if enough rounds are played.
|
| 34. | It has been shown that finding a Nash equilibrium, or in other words, the optimal strategies of this game is computationally tractable.
|
| 35. | However, this is generally a non-optimal strategy in the long-term, since the player does not maximize their gains on their winning hands.
|
| 36. | An optimal strategy is to be physical with him at the line, knowing that you have deep help if he gets away.
|
| 37. | Worm will bet the nuts 100 % of the time, and bet with a bluffing hand ( using mixed optimal strategies ):
|
| 38. | So, I don't understand how an optimal strategy could be developed .-- & trade; 21 : 00, 25 September 2011 ( UTC)
|
| 39. | If only condition one holds then there are likely to be an infinite number of optimal strategies for the player who changed.
|
| 40. | The optimal strategy will use the 1s box in the first round, scoring 1, and the 2s box in the second round, scoring 2.
|
