How to build a poker bot (Part 2 Kuhn Poker)

Learn Texas Holdem Video Source & Info:

Solving the simple Kuhn poker with the counterfactual regret minimization algorithm learn in part 1

Part 1 https://www.youtube.com/watch?v=Wa-fRIBGZZI
Vanilla CFR https://justinsermeno.com/posts/cfr/

Code: https://github.com/IanSullivan/PokerCFR

Source: YouTube

Share this video:

5 thoughts on “How to build a poker bot (Part 2 Kuhn Poker)”

Kai Z says:

October 28, 2020 at 8:52 am

It is really a nice video. Could you please illustrate MCCFR more, if possible? Thanks
Chinmayi Kompella says:

November 16, 2020 at 12:56 am

At 4:15 why is the hypothetical rewards 2 instead of 1?
Sean Campbell says:

January 6, 2021 at 5:36 am

Nice! Do you have a github with the code? It's easier to read it that way
Haja says:

January 22, 2021 at 12:16 pm

Why do you calculate node.regret_sum on line 58 and 61 by only multiplying with the opponents probability on line 58, for example: node.regret_sum += pr_2 * regrets ? Why not the total probability: node.regret_sum += pr_2 * pr_1 * regrets ?
Alexey Ryumin says:

September 9, 2021 at 6:26 pm

I hope this video will be banned soon

Comments are closed.