Live data from Hacker News

Poker Tournament for LLMs

pokerbattle.ai

41–50 of 212 posts

Re: Poker Tournament for LLMs

#41
post #32

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 exp…

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?

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

Re: Poker Tournament for LLMs

#42
post #35

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 exp…

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.

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.

Re: Poker Tournament for LLMs

#43

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 exp…

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.

Re: Poker Tournament for LLMs

#44

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 exp…

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.

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.

Re: Poker Tournament for LLMs

#45

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 exp…

Do you have more info on deterministic equilibrium strategies for us (total beginners in the field) to learn about?

This is the citation for [0]: Sparsified Linear Programming for Zero-Sum Equilibrium Finding https://arxiv.org/pdf/2006.03451

Re: Poker Tournament for LLMs

#46

I would love to see a live stream of this but they’re also allowed to talk to each other - bluff, trash talk. That would be a much more interesting test of LLMs and a pretty decent spectator sport.

I did this for Risk. Was good fun (in a token hungry kind of way).

https://andreasthinks.me/posts/ai-at-play/

Re: Poker Tournament for LLMs

#47
post #43

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 exp…

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.

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!

Re: Poker Tournament for LLMs

#48

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 exp…

>>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.

Re: Poker Tournament for LLMs

#49
Imo, this shows that LLMs are nice for compression, OCR and other similar tasks, but there is 0% thinking / logic involved:

magistral: "Turn card pairs the board with a T, potentially completing some straights and giving opponents possible two-pair or better hands"

A card which pairs the board does not help with straights. The opposite is true. Far worse then hallucinating a function signature which does not exist, if you base anything on these types of fundamental errors, you build nothing.

Read 10 turns on the website and you will find 2-3 extreme errors like this. There needs to be a real breakthrough regarding actual thinking(regardless of how slow/expensive it might be) before I believe there is a path to AGI.

Re: Poker Tournament for LLMs

#50
post #43

Earlier quoted context omitted.

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.

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!

>>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.

Post reply on HN