michalsustr
21 hours ago
I have PhD in algorithmic game theory and worked on poker.
1) There are currently no algorithms that can compute deterministic equilibrium strategies [0]. Therefore, mixed (randomized) strategies must be used for professional-level play or stronger.
2) In practice, strong play has been achieved with: i) online search and ii) a mechanism to ensure strategy consistency. Without ii) an adaptive opponent can learn to exploit inconsistency weaknesses in a repeated play.
3) LLMs do not have a mechanism for sampling from given probability distributions. E.g. if you ask LLM to sample a random number from 1 to 10, it will likely give you 3 or 7, as those are overrepresented in the training data.
Based on these points, it’s not technically feasible for current LLMs to play poker strongly. This is in contrast with Chess, where there is lots more of training data, there exists a deterministic optimal strategy and you do not need to ensure strategy consistency.
[0] There are deterministic approximations for subgames based on linear programming, but require to be fully loaded in memory, which is infeasible for the whole game.
noduerme
20 hours ago
I ran a casino and wrote a bot framework that, with a user's permission, attempted to clone their betting strategy based on their hand history (mainly how they bet as a ratio to the pot in a similar blind odds situation relative to the aggressiveness of players before and after), and I let the players play against their own bots. It was fun to watch. Oftentimes the players would lose against their bot versions for awhile, but ultimately the bot tended to go on tilt, because it couldn't moderate for aggressive behavior around it.
None of that was deterministic and the hardest part was writing efficient monte carlos that could weight each situation and average out a betting strategy close to that from the player's hand history, but throw in randomness in a band consistent with the player's own randomness in a given situation.
And none of it needed to touch on game theory. If it did, it would've been much better. LLMs would have no hope at conceptualizing any of that.
SalmoShalazar
12 hours ago
How did you collect their hand history?
tasuki
11 hours ago
> I ran a casino
It's in the first four words! Which parts have you read?
Dilettante_
10 hours ago
Fell out of the context window
garyfirestorm
18 hours ago
> LLMs would have no hope at conceptualizing any of that.
Counter argument - generating probabilistic tokens (degree of randomness) is core concept for an LLM.
mrob
17 hours ago
It's not. The LLM itself only calculates the probabilities of the next token. Assuming no race conditions in the implementation, this is completely deterministic. The popular LLM inference engine llama.cpp is deterministic. It's the job of the sampler to actually select a token using those probabilities. It can introduce pseudo-randomness if configured to, and in most cases it is configured that way, but there's no requirement to do so, e.g. it could instead always pick the most probable token.
nostrebored
16 hours ago
This is a poor conceptualization of how LLMs work. No implementations of models you’re talking to today are just raw autorrgressive predictors, taking the most likely next token. Most are presented with a variety of potential options and choose from the most likely set. A repeated hand and flop would not be played exactly the same in many cases (but a 27o would have a higher likelihood of being played the same way).
mrob
16 hours ago
>No implementations of models you’re talking to today are just raw autorrgressive predictors, taking the most likely next token.
Set the temperature to zero and that's exactly what you get. The point is the randomness is something applied externally, not a "core concept" for the LLM.
CamperBob2
7 hours ago
Set the temperature to zero and that's exactly what you get.
In some NN implementations, randomness is actually pretty important to keep the gradients from getting stuck at local minima/maxima. Is that true for LLMs, or is it not something that applies at all?
nostrebored
15 hours ago
The amount of problems where people are choosing a temperature of 0 are negligible though. The reason I chose the wording “implementations of models you’re talking to today” was because in reality this is almost never where people land, and certainly not what any popular commercial surfaces are using (Claude code, any LLM chat interface).
And regardless, turning this into a system that has some notion of strategic consistency or contextual steering seems like a remarkably easy problem. Treating it as one API call in, one deterministic and constrained choice out is wrong.
_ink_
20 hours ago
> LLMs do not have a mechanism for sampling from given probability distributions.
They could have a tool for that, tho.
Eckter2
11 hours ago
They already have the tool, it's python interpreter with `random`.
I just tested with a mistral's chat: I asked it to answer either "foo" or "bar" and that I need either option to have the same probability. I did not mention the code interpreter or any other instruction. It did generate and execute a basic `random.choice(["foo", "bar"])` snippet.
I'm assuming more mainstream models would do the same. And I'm assuming that a model would figure out that randomness is important when playing poker.
londons_explore
19 hours ago
They also could be funetuned for it.
Eg. When asked for a random number between 1 and 10, and 3 is returned too often, you penalize that in the fine-tuning process until the distribution is exactly uniform.
collingreen
17 hours ago
RLHF for uniform numbers between 1 and 10, lol. What a world we live in now.
AmbroseBierce
10 hours ago
I get your point, but is by far the most common range humans use for random number generations on a daily basis, so its importance is kind should be expected, as well as expecting common color names have more weight than any hex representation of any of them, or just obscure names nobody uses in real life
andrepd
19 hours ago
World's most overengineered Mersenne twister
eclark
16 hours ago
They would need to lie, which they can't currently do. To play at our current best, our approximation of optimal play involves ranges. Thinking about your hand as being any one of a number of cards. Then imagine that you have combinations of those hands, and decide what you would do. That process of exploration by imagination doesn't work with an eager LLM using huge encoded context.
lawlessone
7 hours ago
>They would need to lie, which they can't currently do
They lie better than most people lol.
jwatte
15 hours ago
I don't think this analysis matches the underlying implementation.
The width of the models is typically wide enough to "explore" many possible actions, score them, and let the sampler pick the next action based on the weights. (Whether a given trained parameter set will be any good at it, is a different question.)
The number of attention heads for the context is similarly quite high.
And, as a matter of mechanics, the core neuron formulation (dot product input and a non-linearity) excels at working with ranges.
eclark
12 hours ago
No the widths are not wide enough to explore. The number of possible game states can explode beyond the number of atoms in the universe pretty easily, especially if you use deep stacks with small big blinds.
For example when computing the counterfactual tree for 9 way preflop. 9 players have up to 6 different times that they can be asked to perform an action (seat 0 can bet 1, seat 1 raises min, seat 2 calls, back to seat 0 raises min, with seat 1 calling, and seat 2 raising min, etc). Each of those actions has check, fold, bet min, raise the min (starting blinds of 100 are pretty high all ready), raise one more than the min, raise two more than the min, ... raise all in (with up to a million chips).
(1,000,000.00 - 999,900.00) ^ 6 times per round ^ 9 players That's just for pre flop. Postflop, River, Turn, Showdown. Now imagine that we have to simulate which cards they have and which order they come in the streets (that greatly changes the value of the pot).
As for LLMs being great at range stats, I would point you to the latest research by UChicago. Text trained LLMs are horrible at multiplication. Try getting any of them to multiply any non-regular number by e or pi. https://computerscience.uchicago.edu/news/why-cant-powerful-...
Don't get what I'm saying wrong though. Masked attention and sequence-based context models are going to be critical to machines solving hidden information problems like this. Large Language Models trained on the web crawl and the stack with text input will not be those models though.
btilly
14 hours ago
What you describe is not a contrast to chess. Current LLMs also do not play chess well. Generally they play at the 1000-1300 ELO level.
Playing specific games well requires specialized game-specific skills. A general purpose LLM generally lacks those. Future LLMs may be slightly better. But for the foreseeable future, the real increase of playing strength is having an LLM that knows when to call out to external tools, such as a specialized game engine. Which means that you're basically playing that game engine.
But if you allow an LLM to do that, there already are poker bots that can play at a professional level.
RivieraKid
19 hours ago
What are you working on specifically? I've been vaguely following poker research since Libratus, the last paper I've read is ReBeL, has there been any meaningful progress after that?
I was thinking about developing a 5-max poker agent that can play decently (not superhumanly), but it still seems like a kind of uncharted territory, there's Pluribus but limited to fixed stacks, very complex and very computationally demanding to train and I think also during gameplay.
I don't see why a LLM can't learn to play a mixed strategy. A LLM outputs a distribution over all tokens, which is then randomly sampled from.
eclark
16 hours ago
Text trained LLM's are likely not a good solution for optimal play, just as in chess the position changes too much, there's too much exploration, and too much accuracy needed.
CFR is still the best, however, like chess, we need a network that can help evaluate the position. Unlike chess, the hard part isn't knowing a value; it's knowing what the current game position is. For that, we need something unique.
I'm pretty convinced that this is solvable. I've been working on rs-poker for quite a while. Right now we have a whole multi-handed arena implemented, and a multi-threaded counterfactual framework (multi-threaded, with no memory fragmentation, and good cache coherency)
With BERT and some clever sequence encoding we can create a powerful agent. If anyone is interested, my email is: elliott.neil.clark@gmail.com
michalsustr
17 hours ago
I'm not working on game-related topics lately, I'm in the industry now (algo-trading) and also little bit out of touch.
> Has there been any meaningful progress after that?
There are attempts [0] at making the algorithms work for exponentially large beliefs (=ranges). In poker, these are constant-sized (players receive 2 cards in the beginning), which is not the case in most games. In many games you repeatedly draw cards from a deck and the number of histories/infosets grows exponentially. But nothing works well for search yet, and it is still open problem. For just policy learning without search, RNAD [2] works okayish from what I heard, but it is finicky with hyperparameters to get it to converge.
Most of the research I saw is concerned about making regret minimization more efficient, most notably Predictive Regret Matching [1]
> I was thinking about developing a 5-max poker
Oh, sounds like lot of fun!
> I don't see why a LLM can't learn to play a mixed strategy. A LLM outputs a distribution over all tokens, which is then randomly sampled from.
I tend to agree, I wrote more in another comment. It's just not something an off-the-shelf LLM would do reliably today without lots of non-trivial modifications.
[0] https://arxiv.org/abs/2106.06068
Lerc
19 hours ago
>3) LLMs do not have a mechanism for sampling from given probability distributions. E.g. if you ask LLM to sample a random number from 1 to 10, it will likely give you 3 or 7, as those are overrepresented in the training data.
I am not sure that is true. Yes it will likely give a 3 or 7 but that is because it is trying to represent that distribution from the training data. It's not trying for a random digit there, it's trying for what the data set does.
It would certainly be possible to give an AI the notion of a random digit, and rather than training on fixed output examples give it additional training to make it to produce an embedding that was exactly equidistant from the tokens 0..9 when it wanted a random digit.
You could then fine tune it to use that ability to generate sequences of random digits to provide samples in reasoning steps.
48terry
15 hours ago
I have a better idea: random.randint(1,10)
Lerc
13 hours ago
That requires tool use or some similar specific action at inference time.
The technique I suggested would, I think, work on existing model inference methods. The ability already exists in the architecture. It's just a training adjustment to produce the parameters required to do so.
andreyk
14 hours ago
But LLMs would presumably also condition on past observations of opponents - i.e. LLMs can conversely adapt their strategy during repeated play (especially if given a budget for reasoning as opposed to direct sampling from their output distributions).
The rules state the LLMs do get "Notes hero has written about other players in past hands" and "Models have a maximum token limit for reasoning" , so the outcome might be at least more interesting as a result.
The top models on the leaderboard are notably also the ones strongest in reasoning. They even show the models' notes, e.g. Grok on Claude: "About: claude Called preflop open and flop bet in multiway pot but folded to turn donk bet after checking, suggesting a passive postflop style that folds to aggression on later streets."
PS The sampling params also matter a lot (with temperature 0 the LLMs are going to be very consistent, going higher they could get more 'creative').
PPS the models getting statistics about other models' behavior seems kind of like cheating, they rely on it heavily, e.g. 'I flopped middle pair (tens) on a paired board (9s-Th-9d) against LLAMA, a loose passive player (64.5% VPIP, only 29.5% PFR)'
godelski
9 hours ago
> Based on these points, it’s not technically feasible for current LLMs to play poker strongly.
To add to this a little bit it's important to note the limitations of this project. It's interesting, but I think it is probably too easy to misinterpret the results.A few things to note:
- It is LLMs playing against one another
- not against humans and not against professional humans.
- Not an LLM being trained in poker against other LLMs (there are token limits too, so not even context)
- Poker is a zero sum game.
- Early wins can shift the course of these types of games, especially when more luck based[0][1]
(note: this isn't an explanation, but it is a flag. Context needed to interpret when looking at hands)
- Lucky wins can have similar effects
- Only one tournament.
Makes it hard to rule out luck issues
So important to note that it is not necessarily a good measure of a LLM's ability to play poker well, but it can to some extent tell us if the models understand the rules (I would hope so!)But also there's some technical issues that make me suspicious... (was the site LLM generated?)
- There's $20 extra in the grand total (assuming initial bankroll was $100k and not $100,002.22222222...)
(This feels like a red flag...)
- Hands 1-57 are missing?
- Though I'm seeing "Hand #67" on the left table and "Hand #13" in the title above the associated image. But a similar thing happens for left column "Hand #58" and "Hand #63"...
- There are pots with $0, despite there being a $30 ante...
(Maybe I'm confused how the data is formatted? Is hand 67 a reset? There were bets pre-flop and only Grok has a flop response?)
[0] Think of it this way: we play a game of "who can flip the most heads". But we determine the number of coins we can flip by rolling some dice. If you do better on the dice roll you're more likely to do better on the coin flip.[1] LLAMA's early loss makes it hard to come back. This wouldn't explain the dive at hand ~570. Same in reverse can be said about a few of the positive models. But we'd need to look deeper since this isn't a game of pure chance.
lawlessone
8 hours ago
I'm wondering how they relay the passage of time to the LLM? If the player just before you took 1 second or 10 seconds to make a decision that probably means something , unless they always take that amount of time.
nabla9
20 hours ago
Question:
If you put the currently best poker algorithm in a tournament with mixed-skill-level players, how likely is the algorithm to get into the money?
Recognizing different skill levels quickly and altering your play for the opponent in the beginning grows the pot very fast. I would imagine that playing against good players is completely different game compared to mixed skill levels.
michalsustr
20 hours ago
Agreed. I don't know how fast it would get into the money, but an equilibrium strategy is guaranteed to not lose, in expectation. So as long as the variance doesn't make it to run out of money, over the long run it should collect most of the money in the game.
It would be fun to try!
nabla9
20 hours ago
> equilibrium strategy is guaranteed to not lose,
In my scenario and tournament play. Are you sure?
I would be shocked to learn that there is a Nash equilibrium in multi-player setting, or any kind of strategic stability.
michalsustr
19 hours ago
In multi-player you don't have guarantees, but it tends to work well anyway: https://www.science.org/doi/full/10.1126/science.aay2400
nabla9
19 hours ago
Thanks.
> with five copies of Pluribus playing against one professional
Although this configuration is designed to water down the difficulty in multi-player setting.
Pluribus against 2 professionals and 3 randos would better test. Two pros would take turns taking money from the 3 randos and Pluribus would be left behind and confused if it could not read the table.
bluecalm
20 hours ago
>>Agreed. I don't know how fast it would get into the money, but an equilibrium strategy is guaranteed to not lose, in expectation.
That's only true for heads-up play. It doesn't apply to poker tournaments.
gsinclair
20 hours ago
FWIW, I’d bet some coin that current CharGPT would provide a genuine pseudo-random number on request. It now has the ability to recognise when answering the prompt requires a standard algorithm instead of ordinary sentence generation.
I found this out recently when I asked it to generate some anagrams for me. Then I asked how it did it.
noduerme
20 hours ago
In the context of gambling, random numbers or prngs can't have any unknown possible frequencies or tendencies. There can't be any doubt as to whether the number could be distorted or hallucinated. A pseudo random number that might or might not be from some algorithm picked by GPT is wayyyy worse than a mersenne twister, because it's open to distortion. Worse, there's no paper trail. MT is not the way to run a casino, or at least not sufficient, but at least you know it's pseudorandom based on a seed. With GPT you cannot know that, which means it doesn't fit the definition of "random" in any way. And if you find yourself watching a player getting blackjack 10 times in a row for $2k per bet, you will ask yourself where those numbers came from.
vintermann
20 hours ago
I think you're missing the point. Current incarnations of GPT can do tool calling, why shouldn't they be able to call on a CSPRNG if they think they'll need a genuinely random number?
recursive
13 hours ago
I don't think LLMs can reliably explain how they do things.
oldestofsports
20 hours ago
I asked chatgpt for a ramdom number between 1 and 10. It answered 7, then i asked for anpther, and it answered 3.
boredemployee
19 hours ago
exactly the same here, 7 first then 3.
HenryBemis
20 hours ago
I asked Gemini and it gave me 8 and then I asked again and it gave me 9.
x______________
19 hours ago
Depends on how you ask it if course. Chatgpt:
Output the random generation of a number between 1 and 10, 100 times
..chatgpt would only provide me with a python script and then offered to add scrolling numbers and colourful digits.Tried again in a new session with:
Generate a random number between 1 and 10, 100 times. Output only
4, 9, 1, 6, 10, 3, 2, 5, 7, 8, 1, 9, 4, 6, 10, 2, 8, 5, 7, 3, 9, 1, 4, 6, 10, 8, 2, 7, 3, 5, 1, 9, 6, 10, 2, 4, 8, 3, 7, 5, 9, 1, 10, 4, 6, 2, 8, 3, 5, 7, 9, 10, 4, 6, 1, 2, 8, 3, 5, 7, 9, 1, 10, 6, 4, 2, 8, 5, 7, 3, 9, 10, 6, 4, 2, 1, 8, 5, 7, 3, 9, 10, 4, 6, 2, 8, 5, 7, 3, 9, 1, 10, 4, 6, 8, 2, 5, 7, 3, 9Notice the issue?
x______________
19 hours ago
Asked again:
Output the random generation of a number between 1 and 10, 100 times
Sorry python is not available, run it locally with offered code.Immediately:
Output the random generation of a number between 1 and 10, 100 times
Sure![5, 2, 7, 1, 10, 4, 9, 8, 3, 6, 2, 5, 9, 7, 1, 10, 4, 8, 3, 6, 7, 3, 9, 2, 5, 8, 10, 1, 4, 6, 8, 4, 6, 10, 9, 7, 1, 5, 3, 2, 9, 10, 3, 1, 7, 2, 4, 8, 6, 5, 3, 8, 5, 2, 10, 9, 6, 1, 4, 7, 4, 9, 8, 6, 1, 3, 7, 2, 10, 5, 6, 7, 5, 9, 3, 10, 8, 2, 1, 4, 1, 3, 8, 5, 2, 6, 9, 4, 10, 7, 10, 5, 2, 9, 8, 3, 7, 1, 4, 6]
Edit: Using the same prompt as above:
-Incognito mode sessions get random:
[3, 10, 1, 7, 2, 8, 4, 9, 5, 6, 1, 4, 9, 2, 10, 3, 8, 7, 6, 5, 7, 3, 10, 8, 4, 2, 9, 1, 5, 6, 6, 8, 2, 9, 3, 10, 5, 7, 1, 4, 5, 9, 3, 7, 8, 2, 6, 10, 1, 4, 2, 7, 5, 9, 10, 8, 3, 4, 6, 1, 4, 1, 8, 10, 5, 9, 7, 6, 3, 2, 9, 5, 6, 2, 7, 10, 4, 3, 8, 1, 8, 4, 2, 9, 1, 6, 10, 5, 3, 7, 10, 6, 9, 3, 8, 5, 1, 7, 2, 4]
[8, 4, 2, 7, 10, 6, 1, 9, 5, 3, 2, 10, 6, 3, 8, 5, 9, 7, 4, 1, 7, 9, 5, 2, 6, 1, 10, 8, 3, 4, 4, 6, 10, 8, 7, 3, 9, 1, 2, 5, 3, 9, 8, 10, 2, 5, 6, 7, 1, 4, 6, 2, 7, 1, 8, 10, 9, 4, 3, 5, 9, 5, 4, 7, 10, 8, 3, 6, 2, 1, 1, 3, 8, 9, 2, 10, 4, 7, 6, 5, 10, 7, 9, 3, 4, 6, 8, 5, 2, 1, 5, 8, 6, 10, 9, 1, 7, 2, 4, 3]
-Normal browser sessions get loops:
3, 7, 1, 9, 5, 10, 4, 6, 2, 8, 1, 10, 3, 5, 7, 9, 2, 6, 8, 4, 9, 5, 3, 10, 1, 7, 6, 2, 8, 4, 5, 9, 10, 1, 3, 7, 4, 8, 6, 2, 9, 5, 10, 7, 1, 3, 8, 4, 6, 2, 5, 9, 10, 1, 7, 3, 4, 8, 6, 2, 5, 9, 10, 1, 3, 7, 4, 8, 2, 6, 5, 9, 10, 1, 3, 7, 4, 8, 6, 2, 5, 9, 10, 1, 7, 3, 8, 4, 6, 2, 5, 9, 10, 1, 7, 3, 4, 8, 6, 2
7, 3, 10, 2, 6, 9, 5, 1, 8, 4, 2, 10, 7, 5, 3, 6, 8, 1, 4, 9, 10, 7, 5, 2, 8, 4, 1, 6, 9, 3, 5, 10, 2, 7, 8, 1, 9, 4, 6, 3, 10, 7, 2, 5, 9, 8, 6, 4, 1, 3, 5, 9, 10, 8, 6, 2, 7, 4, 1, 3, 9, 5, 10, 7, 8, 6, 2, 4, 1, 3, 9, 5, 10, 7, 8, 2, 6, 4, 1, 9, 5, 10, 3, 7, 8, 6, 2, 4, 9, 1, 5, 10, 7, 3, 8, 6, 2, 4, 9, 1
This test was conducted with Android & Firefox 128, both Chatgpt sessions were not logged in, yet normal browsing holds a few instances of chatgpt.com visits.
mwigdahl
17 hours ago
Yeesh, that's bad. Nothing ever repeats and it looks like it makes sure to use every number in each sequence of 10 before resetting in the next section. Towards the end it starts grouping evens and odds together in big clumps as well. I wonder if it would become a repeating sequence if you carried it out far enough?
nonethewiser
16 hours ago
optimized to look random in aggregate (mostly)
nonethewiser
16 hours ago
{1: 9, 2: 10, 3: 10, 4: 10, 5: 10, 6: 10, 7: 10, 8: 10, 9: 11, 10: 10}
furyofantares
12 hours ago
> 3) LLMs do not have a mechanism for sampling from given probability distributions. E.g. if you ask LLM to sample a random number from 1 to 10, it will likely give you 3 or 7, as those are overrepresented in the training data.
You can have them output a probability distribution and then have normal code pick the action. There's other ways to do this, you don't need to make the LLM pick a random number.
Nicook
12 hours ago
so you're confirming that what he said is correct
furyofantares
12 hours ago
No.
It's not like an LLM can play poker without some shim around it. You're gonna have to interpret its results and take actions. And you want the LLM to produce a distribution either way before picking an explicit action from that distribution. Having the shim pick the random number instead of the LLM does not take anything away from it.
RA_Fisher
8 hours ago
LLMs can use Python to simulate from probability distributions. Though, admittedly they have to code and use their own MCMC samplers (and can’t yet utilize Stan and PyMC directly).
CGMthrowaway
11 hours ago
>if you ask LLM to sample a random number from 1 to 10, it will likely give you 3 or 7, as those are overrepresented in the training data.
I just tried this on GPT-4 ("give me 100 random numbers from 1 to 10") and it gave me exactly 10 of each number 1-10, but in no particular order. Heh
KalMann
11 hours ago
I think the way you phrase it is important. If you want to test what he said you should try and create 100 independent prompts in which you ask for a number between 1 and 10.
akd
13 hours ago
Facebook built a poker bot called Pluribus that consistently beat professional poker players including some of the most famous ones. What techniques did they use?
jgalt212
12 hours ago
> Pluribus, the AI designed by Facebook AI and Carnegie Mellon University to play six-player No-Limit Texas Hold'em poker, utilizes a variant of Monte Carlo Tree Search (MCTS) as a core component of its decision-making process.
ekropotin
6 hours ago
At least Random numbers problem can easily be solved by giving LLM access to the corresponding tool.
nialv7
15 hours ago
That's fascinating. Are there any introductory literature you would recommend to someone curious about poker AI?
lazyant
14 hours ago
d-moon
15 hours ago
MIT’s IAP Pokerbts class https://github.com/mitpokerbots
IanCal
21 hours ago
How much is needed to get past those? The third one is solvable by giving them a basic tool call, or letting them write some code to run.
michalsustr
20 hours ago
I agree, but they should come up with the distribution as well.
If you directly give the distribution to the LLM, it is not doing anything interesting. It is just sampling from the strategy you tell it to play.
spenczar5
16 hours ago
sure, but that is a fairly trivial tool call too. Ask it to name the distribution family and its parameter values.
tarruda
18 hours ago
> LLMs do not have a mechanism for sampling from given probability distributions
Would a LLM with tool calls be able to do this?
RA_Fisher
8 hours ago
Yes, ChatGPT can do it using Python today (the statsmodels library). I use it all the time (I’m a statistician).
sceptic123
15 hours ago
Then it's not the LLM doing the work
catketch
14 hours ago
this is is a distinction without a difference in many instances. I can easily ask an llm to write a python tool to produce random numbers for a given distribution and then use that tool as needed. The LLM writes the code, and uses the executable result. Then end black box result is the LLM doing the work
sceptic123
13 hours ago
But why limit it to generating random numbers, isn't the logical conclusion that the LLM writes a poker bot instead of playing the game? How would that demonstrate the poker skills of an LLM?
Workaccount2
11 hours ago
There is a distinction, but for all intents and purposes, it's superficial.
animal531
20 hours ago
Do you have more info on deterministic equilibrium strategies for us (total beginners in the field) to learn about?
michalsustr
20 hours ago
This is the citation for [0]: Sparsified Linear Programming for Zero-Sum Equilibrium Finding https://arxiv.org/pdf/2006.03451
mckirk
21 hours ago
What would be your intuition as to which 'quality' of the LLMs this tournament then actually measures? Could we still use it as a proxy for a kind of intelligence, since they need to compensate for the fact that they are not really built to do well in a game like poker?
michalsustr
20 hours ago
The tournament measures the cumulative winnings. However, those can be far from the statistical expectation due to the variance of card distribution in poker.
To establish a real winner, you need to play many games:
> As seen in the Claudico match (20), even 80,000 games may not be enough to statistically significantly separate players whose skill differs by a considerable margin [1]
It is possible to reduce the number of required games thanks to variance reduction techniques [1], but I don't think this is what the website does.
To answer the question - "which 'quality' of the LLMs this tournament then actually measures" - since we can't tell the winner reliably, I don't think we can even make particular claims about the LLMs.
However, it could be interesting to analyze the play from a "psychology profile perspective" of dark triad (psychopaths / machiavellians / narcissists). Essentially, these personality types have been observed to prefer some strategies and this can be quantified [2].
[1] DeepStack, https://static1.squarespace.com/static/58a75073e6f2e1c1d5b36...
[2] Generation of Games for Opponent Model Differentiation https://arxiv.org/pdf/2311.16781
LPisGood
16 hours ago
Regarding the deterministic approximations for subgames based on LP, is there some reference you’re aware of for the state-of-the-art?
josh_carterPDX
10 hours ago
Unlike chess or Go, where both players see the entire board, poker involves hidden information, your opponents’ hole cards. This makes it an incomplete-information game, which is far more complex mathematically. The AI must reason not only about what could happen, but also what might be hidden.
Even in 2-player No-Limit Hold’em, the number of possible game states is astronomically large — on the order of 10³¹ decision points. Because players can bet any amount (not just fixed options), this branching factor explodes far beyond games like chess.
Good poker requires bluffing and balancing ranges and deliberately playing suboptimally in the short term to stay unpredictable. This means an AI must learn probabilistic, non-deterministic strategies, not fixed rules. Plus, no facial cues or tells.
Humans adapt mid-game. If an AI never adjusts, a strong player could exploit it. If it does adapt, it risks being counter-exploited. Balancing this adaptivity is very difficult in uncertain environments.
ramoz
13 hours ago
An LLM in a proper harness (agent) can do all of those things and more.
tomr75
5 hours ago
why can't it just use tool calling for RNG?
frenzcan
16 hours ago
I decided to try this:
> sample a random number from 1 to 10
> ChatGPT: Here’s a random number between 1 and 10: 7
> again
> ChatGPT: Your random number is: 3
mh-
5 hours ago
that's pretty funny.
> give me 11 random numbers in a set with range 1-10, allowing duplicates
> ChatGPT: [3, 7, 1, 4, 9, 2, 6, 3, 10, 8, 5]
I repeated it three times, 3 and 7 were always the first two elements haha.
(I get why, and get why this is stupid to expect it to do, but it still gave me a laugh.)
mh-
5 hours ago
in case my comment made someone wonder what the 'right'* way to do this is, if you needed to for some reason.
> give me 11 random numbers in a set with range 1-10, allowing duplicates. if you don't think an LLM can generate properly pseudorandom numbers, then use your tools to generate them.
This caused it to create and execute a python script that returned
[random.randint(1, 10) for _ in range(11)]
which, of course, worked.* obviously don't leave it up to the model to decide about whether it can do random numbers. I just wanted to see what it would do..
joelthelion
20 hours ago
That's interesting, because you show a fundamental limitation of current LLMs in which there is a skill that humans can learn and that LLMs cannot currently emulate.
I wonder if there are people working on closing that gap.
michalsustr
19 hours ago
Humans are very bad at random number generation as well.
LLMs can do sampling via external tools, but as I wrote in other thread, they can't do this in "token space". I'd be curious to see a demonstration of sampling of a distribution (i.e. some uniform) in the "token space", not via external tool calling. Can you make an LLM sample an integer from 1 to 10, or from any other interval, e.g. 223 to 566, without an external tool?
joelthelion
19 hours ago
They can learn though. Humans can get decent at poker.
throwawaymaths
17 hours ago
Actually that seems exactly wrong. unless you set temperature 0, converting logits to tokens is a random pull. so in principle it should be possible for an llm to recognize that it's being asked for a random number and pull tokens exactly randomly. in practice it won't be exact, but you should be able to rl it to arbitrary closeness to exact
abpavel
19 hours ago
After reading your comment I gave ChatGPT 5 Thinking prompt "Give me a random number from 1 to 10" and it did give me both 1 and 10 after less than 10 tries. I didn't do enough test to do a distribution, but your statement did not hold up to the test.
JamesSwift
15 hours ago
I just tested on sonnet 4.5 and free gpt, and both gave me _perfectly weighted_ random numbers which is pretty funny. GPT only generated 180 before cutting off the response, but it was 18 of each number from 1-10. Claude generated all 1000, but again 100 of each number.
You can even see the pattern [1] in claudes output which is pretty funny
wavemode
16 hours ago
Was it a new conversation every time, or did you ask it 10 times within one conversation? I think parent commenter is referring to the former (which for me just yields 7 every time).
vintermann
20 hours ago
I think you miss the point of this tournament, though. The goal isn't to make the strongest possible poker bot, merely to compare how good LLMs are relative to each other on a task which (on the level they play it) requires a little opponent modeling, a little reasoning, a little common sense, a little planning etc.
bluecalm
20 hours ago
>>1) There are currently no algorithms that can compute deterministic equilibrium strategies [0]. Therefore, mixed (randomized) strategies must be used for professional-level play or stronger.
It's not that the algorithm is currently not known but it's the nature of the game that deterministic equilibrium strategies don't exist for anything but most trivial games. It's very easy to prove as well (think Rock-Paper-Scissors).
>>2) In practice, strong play has been achieved with: i) online search and ii) a mechanism to ensure strategy consistency. Without ii) an adaptive opponent can learn to exploit inconsistency weaknesses in a repeated play.
In practice strong play was achieved by computing approximate equilibria using various algorithms. I have no idea what you mean by "online search" or "mechanism to ensure strategy consistency". Those are not terms used by people who solve/approximate poker games.
>>3) LLMs do not have a mechanism for sampling from given probability distributions. E.g. if you ask LLM to sample a random number from 1 to 10, it will likely give you 3 or 7, as those are overrepresented in the training data.
This is not a big limitation imo. LLM can give an answer like "it's likely mixed between call and a fold" and then you can do the last step yourself. Adding some form of RNG to LLM is trivial as well and already often done (temperature etc.)
>>Based on these points, it’s not technically feasible for current LLMs to play poker strongly
Strong disagree on this one.
>>This is in contrast with Chess, where there is lots more of training data, there exists a deterministic optimal strategy and you do not need to ensure strategy consistency.
You can have as much training data for poker as you have for chess. Just use a very strong program that approximates the equilibrium and generate it. In fact it's even easier to generate the data. Generating chess games is very expensive computationally while generating poker hands from an already calculated semi-optimal solution is trivial and very fast.
The reason both games are hard for LLMs is that they require precision and LLMs are very bad at precision. I am not sure which game is easier to teach an LLM to play well. I would guess poker. They will get better at chess quicker though as it's more prestigious target, there is way longer tradition of chess programming and people understand it way better (things like game representation, move representation etc.).
Imo poker is easier because it's easier to avoid huge blunders. In chess a miniscule difference in state can turn a good move into a losing blunder. Poker is much more stable so general not-so-precise pattern recognition should do better.
I am really puzzled by "strategy consistency" term. You are a PhD but you use a term that is not really used in either poker nor chess programming. There really isn't anything special about poker in comparison to chess. Both games come down to: "here is the current state of the game - tell me what the best move is".
It's just in poker the best/optimal move can be "split it to 70% call and 30% fold" or similar. LLMs in theory should be able to learn those patterns pretty well once they are exposed to a lot of data.
It's true that multiway poker doesn't have "optimal" solution. It has equilibrium one but that's not guaranteed to do well. I don't think your point is about that though.
LPisGood
16 hours ago
> There really isn't anything special about poker in comparison to chess
They are dramatically different. There is no hidden information in chess, there are only two players in chess, the number of moves you can make is far smaller in chess, and there is no randomness in chess. This is why you never hear about EV in chess theory, but it’s central to poker.
bluecalm
15 hours ago
>>There is no hidden information in chess
Hidden information doesn't make a game more complicated. Rock Paper Scissors have hidden information but it's a very simple game for example. You can argue there is no hidden information in poker either if you think in terms of ranges. Your inputs are the public cards on the board and betting history - nothing hidden there. Your move requires a probability distribution across the whole range (all possible hands). Framed like that hidden information in poker disappears. The task is to just find the best distributions so the strategy is unexploitable - same as in chess (you need to play moves that won't lose and preferably win if the opponent makes a mistake).
LPisGood
11 hours ago
More complicated? That’s ambiguous. It certainly makes it different.
If you apply probabilistic methods it doesn’t remove hidden information from the problem. These are just quite literally the techniques used to deal with hidden information.
hadeson
19 hours ago
I don't think it's easier, a bad poker bot will lose a lot over a large enough sample size. But maybe it's easier to incorporate exploitation into your strategy - exploits that rely more on human psychology than pure statistics?
Cool_Caribou
19 hours ago
Is limit poker a trivial game? I believe it's been solved for a long time already.
eclark
15 hours ago
No it's far from trivial for three reasons.
First being the hidden information, you don't know your opponents hand holdings; that is to say everyone in the game has a different information set.
The second is that there's a variable number of players in the game at any time. Heads up games are closer to solved. Mid ring games have had some decent attempts made. Full ring with 9 players is hard, and academic papers on it are sparse.
The third is the potential number of actions. For no limit games there's a lot of potential actions, as you can bet in small decimal increments of a big blind. Betting 4.4 big blinds could be correct and profitable, while betting 4.9 big blinds could be losing, so there's a lot to explore.
bluecalm
19 hours ago
>>Is limit poker a trivial game? I believe it's been solved for a long time already.
It's definitely not trivial. Solving it (or rather approximating the solution close enough to 0) was a big achievement. It also doesn't have a deterministic solution. A lot of actions in the solution are mixed.
michalsustr
19 hours ago
> It's not that the algorithm is currently not known but it's the nature of the game that deterministic equilibrium strategies don't exist for anything but most trivial games.
Thanks for making this more precise. Generally for imperfect-information games, I agree it's unlikely to have deterministic equilibrium, and I tend to agree in the case of poker -- but I recall there was some paper that showed you can get something like 98% of equilibrium utility in poker subgames, which could make deterministic strategy practical. (Can't find the paper now.)
> I have no idea what you mean by "online search"
Continual resolving done in DeepStack [1]
> or "mechanism to ensure strategy consistency"
Gadget game introduced in [3], used in continual resolving.
> "it's likely mixed between call and a fold"
Being imprecise like this would arguably not result in a super-human play.
> Adding some form of RNG to LLM is trivial as well and already often done (temperature etc.)
But this is in token space. I'd be curious to see a demonstration of sampling of a distribution (i.e. some uniform) in the "token space", not via external tool calling. Can you make an LLM sample an integer from 1 to 10, or from any other interval, e.g. 223 to 566, without an external tool?
> You can have as much training data for poker as you have for chess. Just use a very strong program that approximates the equilibrium and generate it.
You don't need an LLM under such scheme -- you can do a k-NN or some other simple approximation. But any strategy/value approximation would encounter the very same problem DeepStack had to solve with gadget games about strategy inconsistency [5]. During play, you will enter a subgame which is not covered by your training data very quickly, as poker has ~10^160 states.
> The reason both games are hard for LLMs is that they require precision and LLMs are very bad at precision.
How you define "precision" ?
> I am not sure which game is easier to teach an LLM to play well. I would guess poker.
My guess is Chess, because there is more training data and you do not need to construct gadget games or do ReBeL-style randomizations [4] to ensure strategy consistency [5].
[3] https://arxiv.org/pdf/1303.4441
bluecalm
19 hours ago
>> but I recall there was some paper that showed you can get something like 98% of equilibrium utility in poker subgames, which could make deterministic strategy practical. (Can't find the paper now.)
Yeah I can see that for sure. That's also a holy grail of a poker enthusiast "can we please have non-mixed solution that is close enough". The problem is that 2% or even 1% equilibrium utility is huge. Professional players are often not happy seeing solutions that are 0.5% or less from equilibrium (measured by how much the solution can be exploited).
>>Continual resolving done in DeepStack [1]
Right, thank you. I am very used to the term resolving but not "online search". The idea here is to first approximate the solution using betting abstraction (for example solving with 3 bet sizes) and then hope this gets closer to the real thing if we resolve parts of the tree with more sizes (those parts that become relevant for the current play).
>>Gadget game introduced in [3], used in continual resolving.
I don't see "strategy consistency" in the paper nor a gadget game. Did you mean a different one?
>>Being imprecise like this would arguably not result in a super-human play.
Well, you have noticed that we can get somewhat close with a deterministic strategy and that is one step closer. There is nothing stopping LLMs from giving more precise answers like 70-30 or 90-10 or whatever.
>>But this is in token space. I'd be curious to see a demonstration of sampling of a distribution (i.e. some uniform) in the "token space", not via external tool calling. Can you make an LLM sample an integer from 1 to 10, or from any other interval, e.g. 223 to 566, without an external tool?
It doesn't have to sample it. It just needs to approximate the function that takes a game state and outputs the best move. That move is a distribution, not a single action. It's purely about pattern recognition (like chess). It can even learn to output colors or w/e (yellow for 100-0, red for 90-10, blue for 80-20 etc.). It doesn't need to do any sampling itself, just recognize patterns.
>>You don't need an LLM under such scheme -- you can do a k-NN or some other simple approximation. But any strategy/value approximation would encounter the very same problem DeepStack had to solve with gadget games about strategy inconsistency [5]. During play, you will enter a subgame which is not covered by your training data very quickly, as poker has ~10^160 states.
Ok, thank you I see what you mean by strategy consistency now. It's true that generating data if you need resolving (for example for no-limit poker) is also computationally expensive.
However your point:
>You don't need an LLM under such scheme -- you can do a k-NN or some other simple approximation.
Is not clear to me. You can say that about any other game then, no? The point of LLMs is that they are good at recognizing patterns in a huge space and may be able to approximate games like chess or poker pretty efficiently unlike traditional techniques.
>>How you define "precision" ?
I mean that there are patterns that seem very similar but result in completely different correct answers. In chess a miniscule difference in positions may result in a the same move being a winning one in one but a losing one in another. In poker if you call 25% more or 35% more if the bet size is 20% smaller is unlikely to result in a huge blunder. Chess is more volatile and thus you need more "precision" telling patterns apart.
I realize it's nota technical term but it's the one that comes to mind when you think about things LLMs are good and bad at. They are very good at seeing general patterns but weak when they need to be precise.
michalsustr
17 hours ago
I agree it is possible to build an LLM to play poker, with appropriate tool calling, in principle.
I think it's useful to distinguish what LLMs can do in a) theory, b) non-LLM approaches we know work and c) how to do it with LLMs.
In a) theory, LLMs with the "thinking" rollouts are equivalent to (finite-tape) Turing machine, so they can do anything a computer can, so a solution exists (given large-enough neural net/rollout). To do the sampling, I agree the LLM can use an external tool call. This a good start!
For b) to achieve strong performance in poker, we know you can do continual resolving (e.g. search + gadget)
For c) "Quantization" as you suggested is an interesting approach, but it goes against the spirit of "let's have a big neural net that can do any general task". You gave an example how to quantize for a state that has 2 actions. But what about 3? 4? Or N? So in practice, to achieve such generality, you need to output in the token space.
On top of that, for poker, you'd need LLM to somehow implement continual resolving/ReBeL (for equilibrium guarantees). To do all of this, you need either i) LLM call the CPU implementation of the resolver or ii) the LLM to execute instructions like a CPU.
I do believe i) is practically doable today, to e.g. finetune an LLM to incorporate value function in its weights and call a resolver tool, but not something ChatGPT and others can do (to come to my original parent post). Also, in such finetuning process, you will likely trade-off the LLM generality for specialization.
> you can do a k-NN or some other simple approximation. [..] You can say that about any other game then, no?
Yes, you can approximate value function with any model (k-NN, neural net, etc).
> In poker if you call 25% more or 35% more if the bet size is 20% smaller is unlikely to result in a huge blunder. Chess is more volatile and thus you need more "precision" telling patterns apart.
I see. The same applies for Chess however -- you can play mixed strategies there too, with similar property - you can linearly interpolate expected value between losing (-1) and winning (1).
Overall, I think being able to incorporate a value function within an LLM is super interesting research, there are some works there, e.g. Cicero [6], and certainly more should be done, e.g. have a neural net to be both a language model and be able to do AlphaZero-style search.
bluecalm
15 hours ago
I agree with everything here. Thank you for interesting references and links as well!. One point I would like to make:
>>On top of that, for poker, you'd need LLM to somehow implement continual resolving/ReBeL (for equilibrium guarantees). To do all of this, you need either i) LLM call the CPU implementation of the resolver or ii) the LLM to execute instructions like a CPU.
Maybe we don't. Maybe there are general patterns that LLM could pick up so it could make good decisions in all branches without resolving anything, just looking at the current state. For example LLM could learn to automatically scale calling/betting ranges depending on the bet size once it sees enough examples of solutions coming from algorithms that use resolving.
I guess what I am getting at is that intuitively there is not that much information in poker solutions in comparison to chess so there are more general patterns LLMs could pick up on.
I remember the discussion about the time heads-up limit holdem was solved and arguments that it's bigger than chess. I think it's clear now that solution to limit holdem is much smaller than solution to chess is going to be (and we haven't even started on compression there that could use internal structure of the game). My intuition is that no-limit might still be smaller than chess.
>>I see. The same applies for Chess however -- you can play mixed strategies there too, with similar property - you can linearly interpolate expected value between losing (-1) and winning (1).
I mean that in chess the same move in seemingly similar situation might be completely wrong or very right and a little detail can turn it from the latter to the former. You need a very "precise" pattern recognition to be able to distinguish between those situations. In poker if you know 100% calling with a top pair is right vs a river pot bet you will not make a huge mistakes if you 100% call vs 80% pot bet for example.
When NN based engines appeared (early versions of Lc0) it was instantly clear they have amazing positional "understanding" but get lost quickly when the position required a precise sequence of moves.
jwatte
15 hours ago
Tool using LLMs can easily be given a tool to sample whatever distribution you want. The trick is to proompt them when to invoke the tool, and correctly use its output.
amarant
10 hours ago
>3) LLMs do not have a mechanism for sampling from given probability distributions. E.g. if you ask LLM to sample a random number from 1 to 10, it will likely give you 3 or 7, as those are overrepresented in the training data.
I went and tested this, and asked chat gpt for a random number between 1 and 10, 4 times.
It gave me 7,3,9,2.
Both of the numbers you suggested as more likely came as the first 2 numbers. Seems you are correct!
lcnPylGDnU4H9OF
10 hours ago
I recall a video (I think it was Veritasium) which featured interviews of people specifically being asked to give a "random" number (really, the first one they think of as "random") between 1 and 50. The most common number given was 37. The video made an interesting case for why.
(It was Veritasium but it was actually a number from 1 to 100, the most common number was 7 and the most common 2-digit number was 37: https://www.youtube.com/watch?v=d6iQrh2TK98.)