TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Counterfactual Regret Minimisation or How I won any money in Poker?

117 点作者 whoami_nr超过 1 年前

7 条评论

munchler超过 1 年前
I used CFR to solve another card game called Setback (aka Auction Pitch), which is a trick-taking game that’s similar to, but simpler than, Bridge.<p>CFR is very effective, but slow and requires a lot of RAM. I had to create a smaller, abstract version of the game, solve that, and then map the result back to the actual game, so I didn’t end up with a perfect Nash equilibrium, but the solution does still play at a super-human level.<p>One of the interesting things about my approach is that it actually uses CFR at two separate levels: First it solves a single-deal version of the game, then it uses that solution to run CFR again on a repeated version of the game where each player accumulates points across multiple deals. (Bidding in Setback is highly score-dependent.)<p>I think a similar approach might be possible for Hearts, but I haven’t tried it yet. Solving Bridge with CFR may be beyond our current capability, but could also be possible in the future.<p>[0]: <a href="https:&#x2F;&#x2F;www.bernsrite.com&#x2F;Setback" rel="nofollow">https:&#x2F;&#x2F;www.bernsrite.com&#x2F;Setback</a><p>[1]: <a href="https:&#x2F;&#x2F;github.com&#x2F;brianberns&#x2F;Setback">https:&#x2F;&#x2F;github.com&#x2F;brianberns&#x2F;Setback</a><p>[2]: <a href="https:&#x2F;&#x2F;github.com&#x2F;brianberns&#x2F;Cfrm">https:&#x2F;&#x2F;github.com&#x2F;brianberns&#x2F;Cfrm</a>
jeffreyrogers超过 1 年前
The commercially available solvers may be using CFR, but they are not anywhere near as strong as Pluribus because Pluribus pre-computed solutions for a reduced state space, then mapped the hand and actions into that reduced space and solved from there. That meant Pluribus could come up with a much better solution in much less time than the commercial solvers. This is also why most of the solvers only solve heads up.
评论 #38831184 未加载
blackbear_超过 1 年前
I&#x27;m curious if one can make any money playing poker online while following some computer-optimized strategy. I assume many (most?) players are already doing this. Insights are appreciated :)
评论 #38830671 未加载
评论 #38830574 未加载
Vecr超过 1 年前
That&#x27;s evidential decision theory, right? You minimize the expected regret. If that&#x27;s not risk adverse enough for you, you can weight together multiple perturbation groups for your world model and utility function.
yodon超过 1 年前
The OP mentions use of CFR in transportation logistics problems. Does anyone know of examples?
joelthelion超过 1 年前
Something that is surprising to me is that there are seemingly no strong open-source poker AIs available. Maybe it&#x27;s because implementing CFR for poker is genuinely difficult?
评论 #38830689 未加载
评论 #38835119 未加载
rightbyte超过 1 年前
I made a CRM bot for Texas hold-em limited using the uni supercomputer in 2012 something. It was quite good, beat the reference bots, but it could not play online. I think there was house bots or already mainly good bots in the poker rooms at that time. Internet poker has been broken for a long long time.
评论 #38835543 未加载