Automatic Bidding for the Game of Skat | SpringerLink
Skip to main content
Springer Nature Link
Log in

Automatic Bidding for the Game of Skat

  • Conference paper
KI 2008: Advances in Artificial Intelligence (KI 2008)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5243))

Included in the following conference series:

Abstract

In recent years, researchers started to study the game of Skat. The strength of existing Skat playing programs is definitely the card play phase. The bidding phase, however, has been treated quite poorly so far. This is a severe drawback since bidding abilities influence the overall playing performance drastically. In this paper we present a powerful bidding engine which is based on a k-nearest neighbor algorithm.

This work was partly supported by the German Research Foundation (DFG) as part of the Transregional Collaborative Research Center “Automatic Verification and Analysis of Complex Systems” (SFB/TR 14 AVACS). See http://www.avacs.org/ for more information.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Kupferschmid, S., Helmert, M.: A Skat player based on Monte-Carlo simulation. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M(J.) (eds.) CG 2006. LNCS, vol. 4630, pp. 135–147. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  2. Schäfer, J.: Monte-Carlo-Simulationen bei Skat. Bachelor thesis, Otto-von-Guericke-Universität Magdeburg (2005)

    Google Scholar 

  3. International Skat Players Association: International Skat and Tournament Order 2007 (2008), http://www.skatcanada.ca/canada/forms/rules-2007.pdf

  4. Mitchell, T.M.: Machine Learning. McGraw-Hill, New York (1997)

    MATH  Google Scholar 

  5. Ginsberg, M.L.: GIB: Steps toward an expert-level Bridge-playing program. In: Proceedings of the 16th International Joint Conference on Artificial Intelligence, pp. 584–589 (1999)

    Google Scholar 

  6. Frank, I., Basin, D.A.: Search in games with incomplete information: A case study using Bridge card play. Artificial Intelligence 100, 87–123 (1998)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Freiburg, Germany

    Thomas Keller & Sebastian Kupferschmid

Authors
  1. Thomas Keller
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sebastian Kupferschmid
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andreas R. Dengel Karsten Berns Thomas M. Breuel Frank Bomarius Thomas R. Roth-Berghofer

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Keller, T., Kupferschmid, S. (2008). Automatic Bidding for the Game of Skat. In: Dengel, A.R., Berns, K., Breuel, T.M., Bomarius, F., Roth-Berghofer, T.R. (eds) KI 2008: Advances in Artificial Intelligence. KI 2008. Lecture Notes in Computer Science(), vol 5243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85845-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85845-4_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85844-7

  • Online ISBN: 978-3-540-85845-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation