Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Do you obtain an low exploitability when using OS-MCCFR? #7

Open
KK666-AI opened this issue Aug 27, 2018 · 0 comments
Open

Do you obtain an low exploitability when using OS-MCCFR? #7

KK666-AI opened this issue Aug 27, 2018 · 0 comments

Comments

@KK666-AI
Copy link

HI, i try to run your code 'test_oscfr.py' to obtain the exploitability curve for leduc hold'em, but i meet an error like that below:

next_reachprobs = [{ hc: reachprobs[player][hc[0:prevlen]] / possible_deals for hc in root.children[0].holecards[player] } for player in range(self.rules.players)]
KeyError: (Ks,)

BTW, i write another code to calculate exploitability for leduc hold'em (stack=5), but i could only obtain an exploitability=0.4 after 100,000+ iterations. I am not sure it's the reason of the high variance of out-come sampling or there exists some bugs in my code.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant