On the computational complexity of bridgecard

DOI10.1007/S10878-014-9725-1MaRDI QIDQ5963617zbMATH OpenOpenAlexFDO

Authors Zihan Tan

Publication date 23 February 2016

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-014-9725-1

zbMATH Keywords

computational complexityapproximation algorithmbridgecard

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Stochastic programming (90C15)

Recommendations

• Hanabi is NP-complete, even for cheaters who look at their cards
• GIB: Imperfect information in a computationally challenging game
• A study of a generalization of a card problem
• The computational complexity of the game of Set and its theoretical applications
• The complexity of solitaire

Cites work

• scientific article; zbMATH DE number 1834637 (Why is no real title available?)
• Non-deterministic exponential time has two-prover interactive protocols

Cited in

(8)

• Learning to bid in bridge
• Diagrammatic Representation and Inference
• Hanabi is NP-complete, even for cheaters who look at their cards
• A study of a generalization of a card problem
• Dynamic Play via Suit Factorization Search in Skat
• Complexity of Scorpion solitaire and applications to Klondike
• UNO is hard, even for a single player
• Hanabi is NP-hard, even for cheaters who look at their cards

This page was built for publication: On the computational complexity of bridgecard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963617)