Formal Specification
Skat — Formal Specification
Germany · card · Confidence: high
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: directGap-fills: 1
# Skat — AI-optimized specification
## General idea
A 3-player asymmetric trick-taking game with imperfect information and a 32-card deck. Players participate in a numerical auction based on hand valuation to select a soloist. The soloist can integrate the two face-down cards of the *Skat* into their hand before declaring a contract (Suit game, Grand, or Null), subsequently playing solo against the combined trick defense of the two opposing players to reach 61 points.
## Formal model
- **Abstraction taken:** None required; the International Skat Order (ISkO) defines a complete, rigorous finite-state machine.
- **Player/agent count:** Exactly 3 agents (Forehand , Middlehand , Rearhand ).
- **Turn model:** Strictly sequential clockwise auction and trick-taking phases.
## Formal rules
R1. **Deck & Dealing:** 32 cards (4 suits 8 ranks). Cards dealt: 3 to each agent, 2 to the *Skat*, 4 to each, 3 to each. Each agent holds a private 10-card hand; 2 cards lie in the hidden Skat.
R2. **Bidding Formula & Legal Bid Sequence:** Bids are integers from the valid ISkO sequence . A hand's value is , where is the count of consecutive Jacks held with/without the Club Jack (), and .
R3. **Auction Procedure:** Agent 1 bids to Agent 0. The winning agent then bids with Agent 2. The final highest bidder is declared the *Soloist* ().
R4. **Skat Pickup & Discard:** The Soloist chooses to either:
- Take the 2 Skat cards into hand, then discard exactly 2 cards face-down into their trick pile.
- Play *Hand* (Skat remains untouched; counts toward Soloist's final trick points).
R5. **Contract Declaration:** The Soloist announces one contract: where , , or .
R6. **Trick Play (10 Tricks):** Forehand () leads trick 1.
- Trick leader may play any card in hand.
- Following agents must follow suit (*Bedienpflicht*).
- If unable to follow suit, any card may be discarded or trumped.
- Highest trump played wins the trick; if no trump, highest card of the led suit wins. Winner leads the next trick.
R7. [gap-fill] All-Pass Resolution:** If all 3 agents pass during the auction phase, the deal is recorded as a passed hand (all scores 0) and the dealer button rotates to the next agent.
R8. **Scoring & Victory Evaluation:**
- For Suit and Grand contracts: Soloist sums card points () from won tricks plus the 2 Skat cards. If , the Soloist wins, provided the actual game value (otherwise *Überreizt* loss).
- For Null contracts: Soloist wins if and only if they won exactly 0 tricks.
- Defenders win if the Soloist fails their win condition.
## Edge cases
- Tie at the end condition: Exactly 60 card points for the Soloist results in a loss (the Soloist strictly requires points).
- A player with no legal move: Impossible; any non-empty hand contains at least one legal card obeying *Bedienpflicht*.
- Repetition / cycles: Impossible; exactly 10 tricks of 3 cards are played, exhausting all 30 hand cards.
- Simultaneous claims on the same resource or position: Bidding and card play are strictly sequential.
- Player elimination mid-round; turn order repair: An agent disconnection forfeits the active game to the non-disconnecting party.
- Resource exhaustion (pieces, tokens, space, time): All cards are consumed in exactly 10 tricks.
- Termination guarantee: why the game provably ends: Guaranteed because each trick strictly reduces remaining cards in all players' hands by 1, reaching terminal state at trick 10.
## State representation
- **Persistent state:** Dealer position, auction winner (Soloist ID), declared contract, winning bid value, cumulative match points.
- **Per-player state:** 10-card hand, collected trick cards, private points scored.
- **Per-turn ephemeral state:** Active trick cards , trick lead suit, active player index.
- **Observable information:** Hidden information; opponent hand cards and untouched Skat cards are hidden. All played cards, trick outcomes, bid announcements, and contract declarations are public common knowledge.
## Action space
- `bid(value)`: submit an integer bid value or `pass`.
- `pickup_skat(boolean)`: take Skat cards or declare *Hand*.
- `discard_skat(card_1, card_2)`: select 2 cards to discard.
- `declare_game(contract)`: declare Suit, Grand, or Null.
- `play_card(card_id)`: play one legal card from hand.
## Playability notes
- Single-player-vs-AI: Engine-ready; standard benchmark for imperfect-information AI (e.g. Kermit, IS-MCTS, neural trick evaluators).
- Group games (n>4): In 4-player games, the dealer sits out without receiving cards (*Geber setzt aus*).
- Physical-skill games: Not applicable; pure discrete card strategy.
- What is lost in the adaptation: Subtle cognitive pacing and German card-slapping table theatrics.
## Implementation hints
Discrete and highly structured. Implement the ISkO bidding sequence lookup table and Jacks multiplier counter first. Milestone 1: verify legal *Bedienpflicht* filtering and contract scoring against 100,000 synthetic deals.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Skat (Germany). (n.d.). Games of Countries. https://gamesofcountries.com/games/de-germany/skat
@misc{gamesofcountries-de-germany-skat,
title = {Skat (Germany)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/de-germany/skat}
}