On Tue, 2009-06-09 at 17:52 +0200, Loic Dachary wrote:
> -----BEGIN PGP SIGNED MESSAGE-----
> Hash: SHA1
>
> Hi,
>
> ( echo import pokereval ; echo 'print
> pokereval.PokerEval().poker_eval(game="holdem",pockets=[["kd","kh"],["ks","kc"]],
> dead=[], board=["__","__","__","__","__"])' ) | python
> {'info': (1712304, 0, 1), 'eval': [{'winlo': 0, 'tielo': 0, 'winhi':
> 37210, 'scoop': 37210, 'loselo': 0, 'ev': 500, 'losehi': 37210,
> 'tiehi': 1637884}, {'winlo': 0, 'tielo': 0, 'winhi': 37210, 'scoop':
> 37210, 'loselo': 0, 'ev': 500, 'losehi': 37210, 'tiehi': 1637884}]}
>
> but the same with the odds webservice will give imprecise results
> because it insists on iterating with monte carlo. It should be fixed
> by detecting that there is not enough combinations to deserve a monte
> carlo exploration.
> Is there a pokereval method to detect if there is enough combinations to deserve a monte carlo exploration ? Thanks. -- Johan Euphrosine <[email protected]>
signature.asc
Description: This is a digitally signed message part
_______________________________________________ Pokersource-users mailing list [email protected] https://mail.gna.org/listinfo/pokersource-users
