Symmetries and Search in Trick-Taking Card Games

  • Author / Creator
    Furtak, Timothy M
  • In this dissertation we consider the problem of cardplay move evaluation in the context of trick-taking card games, specifically the German card game Skat, and to a lesser extent Contract Bridge. To this end we construct symmetry-based search extensions for efficiently solving perfect information game states, for use in a Monte Carlo-based high-performance computer Skat player. We extend these symmetries to construct precomputed endgame lookup tables, reducing search time substantially. Finally, we show that recursive rollout-based move selection techniques can achieve superior performance in Skat and a broad class of parameterized games, with respect to both tournament performance and game-theoretic exploitability.

  • Subjects / Keywords
  • Graduation date
  • Type of Item
  • Degree
    Doctor of Philosophy
  • DOI
  • License
    This thesis is made available by the University of Alberta Libraries with permission of the copyright owner solely for non-commercial purposes. This thesis, or any portion thereof, may not otherwise be copied or reproduced without the written consent of the copyright owner, except to the extent permitted by Canadian copyright law.
  • Language
  • Institution
    University of Alberta
  • Degree level
  • Department
  • Supervisor / co-supervisor and their department(s)
  • Examining committee members and their departments
    • Mueller, Martin (Computing Science)
    • Korf, Richard (Computer Science, University of California, Los Angeles)
    • Holte, Robert (Computing Science)
    • Szafron, Duane (Computing Science)