📚
📚
The Cartographer
The αμ Search Algorithm for the Game of Bridge
November 18, 2019 · Declared Dead · 🏛 MCS@IJCAI
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Tristan Cazenave, Véronique Ventos
arXiv ID
1911.07960
Category
cs.AI: Artificial Intelligence
Citations
12
Venue
MCS@IJCAI
Last Checked
3 months ago
Abstract
αμ is an anytime heuristic search algorithm for incomplete information games that assumes perfect information for the opponents. αμ addresses the strategy fusion and non-locality problems encountered by Perfect Information Monte Carlo sampling. In this paper αμ is applied to the game of Bridge.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
📜 Similar Papers
In the same crypt — Artificial Intelligence
R.I.P.
👻
Ghosted
Explanation in Artificial Intelligence: Insights from the Social Sciences
R.I.P.
👻
Ghosted
Federated Machine Learning: Concept and Applications
R.I.P.
👻
Ghosted
Counterfactual Explanations without Opening the Black Box: Automated Decisions and the GDPR
R.I.P.
👻
Ghosted
DeepAR: Probabilistic Forecasting with Autoregressive Recurrent Networks
R.I.P.
👻
Ghosted
Rainbow: Combining Improvements in Deep Reinforcement Learning
Died the same way — 👻 Ghosted
R.I.P.
👻
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
👻
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
👻
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
👻
Ghosted