all AI news
Transformer Based Planning in the Observation Space with Applications to Trick Taking Card Games
April 23, 2024, 4:42 a.m. | Douglas Rebstock, Christopher Solinas, Nathan R. Sturtevant, Michael Buro
cs.LG updates on arXiv.org arxiv.org
Abstract: Traditional search algorithms have issues when applied to games of imperfect information where the number of possible underlying states and trajectories are very large. This challenge is particularly evident in trick-taking card games. While state sampling techniques such as Perfect Information Monte Carlo (PIMC) search has shown success in these contexts, they still have major limitations.
We present Generative Observation Monte Carlo Tree Search (GO-MCTS), which utilizes MCTS on observation sequences generated by a game …
abstract algorithms applications arxiv card challenge cs.ai cs.lg games information observation planning sampling search search algorithms space state transformer trick type
More from arxiv.org / cs.LG updates on arXiv.org
Jobs in AI, ML, Big Data
Data Engineer
@ Lemon.io | Remote: Europe, LATAM, Canada, UK, Asia, Oceania
Artificial Intelligence – Bioinformatic Expert
@ University of Texas Medical Branch | Galveston, TX
Lead Developer (AI)
@ Cere Network | San Francisco, US
Research Engineer
@ Allora Labs | Remote
Ecosystem Manager
@ Allora Labs | Remote
Founding AI Engineer, Agents
@ Occam AI | New York