A formal framework of 'verdict games' models conversational interaction with a non-strategic judge; the paper frames the Turing test as such a game and reports an LLM simulation where strategic prosecutors win 64% vs 27% for naive ones.
Competing in a Complex Hidden Role Game with Information Set Monte Carlo Tree Search
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Advances in intelligent game playing agents have led to successes in perfect information games like Go and imperfect information games like Poker. The Information Set Monte Carlo Tree Search (ISMCTS) family of algorithms outperforms previous algorithms using Monte Carlo methods in imperfect information games. In this paper, Single Observer Information Set Monte Carlo Tree Search (SO-ISMCTS) is applied to Secret Hitler, a popular social deduction board game that combines traditional hidden role mechanics with the randomness of a card deck. This combination leads to a more complex information model than the hidden role and card deck mechanics alone. It is shown in 10108 simulated games that SO-ISMCTS plays as well as simpler rule based agents, and demonstrates the potential of ISMCTS algorithms in complicated information set domains.
citation-role summary
background 1
citation-polarity summary
fields
cs.AI 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Conversation Games and a Strategic View of the Turing Test
A formal framework of 'verdict games' models conversational interaction with a non-strategic judge; the paper frames the Turing test as such a game and reports an LLM simulation where strategic prosecutors win 64% vs 27% for naive ones.