A Program for Playing Tarok

@article{Lutrek2003APF,
  title={A Program for Playing Tarok},
  author={Mitja Lu{\vs}trek and Matja{\vz} Gams and Ivan Bratko},
  journal={J. Int. Comput. Games Assoc.},
  year={2003},
  volume={26},
  pages={190-197}
}
A program for playing the three-player tarok card game is presented and the complexity of the game is analyzed. To deal with the unknown distributions of other players’ cards, the program uses a sampling method that accomplishes hierarchical clustering to select representative sets of cards from a host of randomly generated sets. A game tree is searched with the alpha-beta algorithm using several common enhancements and an equivalence transposition table, which groups the positions by strategic… 
View via Publisher
dis.ijs.si
10 Citations
Background Citations
5
Methods Citations
3

Figures and Tables from this paper

10 Citations

On the Complexity of Trick-Taking Card Games

A general class of perfect information two-player trick-taking card games dealing with arbitrary numbers of hands, suits, and suit lengths is defined and a proof of PSPACE-completeness for a fragment with bounded number of hands is proved through a reduction from Generalized Geography.

Bidding decision model for the card game Tarok

A decision model for bidding in the card game four-player tarok, built on the basis of Bayesian networks, is presented and high matching of the program's bidding with the bidding of human experts is shown.

Knowledge vs. Simulation for Bidding in Tarok

The knowledge-based decision model for bidding in games with its strategy encoded in a Bayesian network was designed and compared to human experts, showing that it performs on par with them.

Forcing Neurocontrollers to Exploit Sensory Symmetry Through Hard-wired Modularity in the Game of Cellz

It is concluded that significant increases in both speed of evolution and final fitness can be achieved relative to monolithic controllers and it is shown that a simple function approximation task that exhibits sensory symmetry can be used as a quick approximate measure of the utility of an encoding scheme for the more complex game-playing task.

Positive and Negative Results in Approximation and Parameterized Complexity

This thesis presents a new technique called greediness-For-Parameterization and it is used to improve the parameterized complexity of many problems and to obtain parameterized algorithms for some problems in bipartite graphs.

SMAC Advisor : A Decision-Support Tool on Coexistence of Genetically-Modified and Conventional Maize

This paper presents SMAC Advisor, a decision-support tool for the assessment of coexistence between genetically modified and conventional maize. The assessment is based on a qualitative…

A Phantom-Go Program

A better understanding of the fundamentals of Monte-Carlo search in Go is provided and the program called Illusion, which plays Phantom Go at an intermediate level, is discussed.

Solving Games and All That

This work presents a formal framework to represent best-first search algorithms, and proposes an extension of this technique for stacked-matrix games, a generalization of zero-sum perfect information two-player games that allows simultaneous moves.

Learning to bid in bridge

A new decision-making algorithm that allows models to be used for both opponent agents and partners, while utilizing a novel model-based Monte Carlo sampling method to overcome the problem of hidden information is presented.

Combining Tactical Search and Monte-Carlo in the Game of Go

A way to integrate search and Monte-Carlo methods in the game of Go by using search to find the status of tactical goals, builds groups, selects interesting goals, and computes statistics on the realization ofTactical goals during the random games.

References

SHOWING 1-10 OF 12 REFERENCES

GIB: Imperfect Information in a Computationally Challenging Game

GIB, the program being described, involves five separate technical advances: partition search, the practical application of Monte Carlo techniques to realistic problems, a focus on achievable sets to solve problems inherent in the Monte Carlo approach, an extension of alpha-beta pruning from total orders to arbitrary distributive lattices, and the use of squeaky wheel optimization to find approximately optimal solutions to cardplay problems.

Approximating Game-Theoretic Optimal Strategies for Full-scale Poker

The computation of the first complete approximations of game-theoretic optimal strategies for full-scale poker is addressed, and linear programming solutions to the abstracted game are used to create substantially improved poker-playing programs.

A Review of Game-Tree Pruning

  • T. Marsland
  • Computer Science
    J. Int. Comput. Games Assoc.
  • 1986
These essential parts of game-tree searching and pruning are reviewed here, and the performance of refinements, such as aspiration and principal variation search, and aids like transposition and history tables are compared.

A theoretical and empirical investigation of search in imperfect information games

Computer Bridge - A Big Win for AI Planning

An overview of the planning techniques that are incorporated into the BRIDGE BARON and what the program's victory signifies for research on AI planning and game playing are discussed.

The History Heuristic and Alpha-Beta Search Enhancements in Practice

  • J. Schaeffer
  • Computer Science
    IEEE Trans. Pattern Anal. Mach. Intell.
  • 1989
Results indicate that the history heuristic combined with transposition tables significantly outperforms other alpha-beta enhancements in application-generated game trees.

Information in transposition tables

These first experiments on the use of more information per entry versus more entries indicate that additional memory can better be used for storing additional information than for doubling the size of the transposition table.

Data clustering: a review

An overview of pattern clustering methods from a statistical pattern recognition perspective is presented, with a goal of providing useful advice and references to fundamental concepts accessible to the broad community of clustering practitioners.

The challenge of poker

Intelligent system for playing tarok

  • M. LuštrekM. Gams
  • Computer Science
    Proceedings of the 25th International Conference on Information Technology Interfaces, 2003. ITI 2003.
  • 2003
An advanced intelligent system for playing three-player tarok card game based on alpha-beta search with several enhancements such as fuzzy transposition table, which clusters strategically similar positions into generalised game states.