-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Joshua Veit wrote: > I am using poker-eval to calculate probabilities of winning a hand, > and I noticed some variation when I changed the iterations. For > instance, if I run this hand: > > pockets = [ ["tc", "ac"], ["__", "__"]], dead = [], board = ["7h", > "3s", "2c"] > > With iterations = 100,000, EV = 562.51 With iterations = 200,000, > EV = 561.12 With iterations = 500,000, EV = 563.38 With iterations > = 1,000,000, EV = 563.06 > > What is a safe iteration level if I want an "exhaustive" search to > determine the true probability? You can try an exhaustive evaluation instead of monte-carlo.
Cheers -----BEGIN PGP SIGNATURE----- Version: GnuPG v2.0.9 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org iEYEARECAAYFAknTz5YACgkQ8dLMyEl6F23ywwCffpXzxYkoulnB3b3UpE+dYYq8 UFwAnRRxhw8OI7WvIITRzbk25kDtWHXz =Eozy -----END PGP SIGNATURE-----
begin:vcard fn:Loic Dachary n:Dachary;Loic org:pokersource adr:;;12 bd Magenta;Paris;;75010;France email;internet:[email protected] title:Senior Developer tel;work:+33 9 51 18 43 38 tel;cell:+33 6 64 03 29 07 x-mozilla-html:FALSE url:http://dachary.org/ version:2.1 end:vcard
_______________________________________________ Pokersource-users mailing list [email protected] https://mail.gna.org/listinfo/pokersource-users
