Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

GTO (“game theory optimal”) poker solvers are based around a decision tree with pre-set bet sizes (eg: check, bet small, bet large, all in), which are adjusted/optimized for stack depth and position. This simplifies the problem space: including arbitrary bet sizes would make the tree vastly larger and increase computational cost exponentially.


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: