Skip to main content
SpringerLink
Log in

On the computational complexity of bridgecard

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

Bridgecard is a classical trick-taking game utilizing a standard 52-card deck, in which four players in two competing partnerships attempt to “win” each round, i.e. trick. Existing theories and analysis have already attempted to show correlations between system designs and other technical issues with parts of the game, specifically the “Bidding” phase, but this paper will be the first to attempt to initiate a theoretical study on this game by formulating it into an optimization problem. This paper will provide both an analysis of the computational complexity of the problem, and propose exact, as well as, approximation algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Kelsey (1994) Killing defence.

  • Reese (1994) The expert game.

  • Demaine ED (2001) Algorithmic combinatorial game theory.

  • Demaine ED (2010) The complexity of UNO. http://arxiv.org/pdf/1003.2851.pdf

  • Babai L, Fotnow L, Lund C (1991) Non-deterministic exponential time has two-prover interactive protocols. Comput Complex 1(1):3–40

    Article  MATH  Google Scholar 

Download references

Acknowledgments

First and foremost, I would like to show my deepest gratitude to our first professor, Andrew Chichih Yao, who has provided me with good resource in learning and discussing. Without his help I cannot get the opportunity to walk deeply into theory of computer science. I shall extend my thanks to Prof Amy Wang for her guidance and encouragement for me to do deeper analysis on this project. I would also like to thank all my teachers who have helped me to develop the fundamental and essential academic competence: Prof Jian Li, Prof Iddo Tzameret and older student Hongyu Liang. Without their help I cannot gain deeper understanding of the problem. I would also thank Donna Dong for helping me in language. She managed to read the whole paper even if she was not familiar with the background knowledge. And I learned a lot on standard use of English and analytical writing under her guidance. Last but not least, I would like to thank all my friends, especially my three lovely roommates, for their encouragement and support.

Author information

Authors and Affiliations

  1. Tsinghua University, Beijing, China

    Zihan Tan

Authors
  1. Zihan Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zihan Tan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tan, Z. On the computational complexity of bridgecard. J Comb Optim 31, 196–217 (2016). https://doi.org/10.1007/s10878-014-9725-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-014-9725-1

Keywords

Search

Navigation