3 ms·
>there is always a "correct" answer That's wrong. Even when you're holding a good hand, your opponent could hold a better one and reading them is a key element
by yAnonymous 10y ago
>there is always a "correct" answer
That's wrong. Even when you're holding a good hand, your opponent could hold a better one and reading them is a key element of poker. The opponent's hand is an important variable to decide whether you hold the winning hand or not.
If you look at the experiment in detail, you'll find that it was set up in the AI's favor.
>When a hand was all-in before the river no more cards were dealt and each player received his equity in chips.
While all that is less important when you can avoid all-in situations, the main statement -that the other player's behavior is irrelevant- is still wrong.
- yazr 10y ago>>If you look at the experiment in detail, you'll find that it was set up in the AI's favor. Could you elaborate on this ?
- yAnonymous 10y agoLinks were posted here: https://news.ycombinator.com/item?id=13535714 https://news.ycombinator.com/item?id=13535714 As expected, the AI is good at making technically correct decisions and "draining money" from a table by playing hands with sufficient data almost perfectly. However, in decisive all-in situations with little information available, it supposedly wouldn't do so well, regardless of all the learning, but that's what it often comes down to. >Nash Equilibrium is a strategy which ensures that the player who is using it will, at the very least, not fare worse than a player using any other strategy. How do you make this work for situations that can cost you the game in one hand, with little information available? Without observing the opponent's behavior you can't, and for the AI that means it can be forced into making bad calls by playing aggressively, unless the game mode allows for avoiding such decisions, which was the case in this test.