Bot can beat humans in multiplayer hidden-role games
news.mit.edu
news.mit.edu
This is hard for humans to do, and is made interesting by the ample opportunities for intuitive leaps, but I'm not at all surprised that a program would be better at it. It's very easy in these games to incriminate yourself in ways that might go unnoticed by human players but would be incredibly obvious to an agent that's keeping a perfect record of everything that's happened.
>one-night werewolf is unbeatable
You're asking the wrong question for starters. The AI does need to "beat" the game. It is being measured on whether it's better at the game than humans. And my experience is that most One Night games devolve into a 50/50 guess. An AI would be better at calculating the odds of the two proposed game states that the players can't actually differentiate. So the AI would surely trivially win more than human players.
So, of course someone who’s played the game 100,000 or even 10 times is likely to beat someone who’s only just played maybe a handful of games. That’s not a bold - or arguably fair-claim to have beaten a majority of players if those players are all brand new —or a minority of those are veterans— which I suspect is likely given the nature of web based games.
This is interesting in itself. 10 years ago it would have been very hard to write a program beating a human at a game where we don't know what makes a player better than another.
Is this achievement closer to AlphaGo beating Lee Sedol, or is it more like AlphaStar beating a bunch of Bronze league players?
In the 90s, all games were human-mastery only. Even writing a strong checkers AI or Connect4 AI was considered a major accomplishment. Only Tic-Tac-Toe was really bot-perfect.
With AIs winning in Chess, Go, Poker, and more... I guess the kids these days have forgotten how things were like just a few decades ago.
Can bots master this game?
Prove it.
Actually, CFR is really interesting, because it calculates an estimation to the Nash Equalibrium and plays theoretically close to optimal in randomized strategies. Its a straightforward concept from a game-theory perspective, but the "estimation to Nash Equalibrium" part is the interesting part. Since a real Nash Equalibrium is too difficult to calculate, it seems like their estimated Nash-Equalibirum is good enough in practice.
Any "game" with a Nash Equalibrium with randomized strategies should benefit from CFR. Which is most games of "bluffing" and hidden information (Poker, Avalon, Pokemon, Magic the Gathering), and even real-world negotiations, diplomacy, business transactions, etc. etc.
-----------
Since CFR has already proven to be superhuman at Poker, the research problem is now in extending this Nash Equalibirum estimate over to other games. IMO, Avalon / Wearewolf games are too simple, AI Researchers should move to Magic: The Gathering or other more complex games like that instead.