Skip to main content
Formal Specification

Joseon Paper Card Gambling / Ten-Sum Point Showdown — Formal Specification

South Korea · card · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: directGap-fills: 1
# Tujeon — AI-optimized specification ## General idea An incomplete-information card game where agents are dealt 5 cards from a 40-card multiset. Agents must solve a subset-sum combinatorial problem to find three cards summing to a multiple of 10 (10,20,30), ranking the remaining two cards via a pair hierarchy (*Ttaeng*) or modulo-10 unit sum (*Gkeut*). ## Formal model - **Abstraction taken:** Direct discrete card deck modeling. Standard 40-card deck D={1,2,…,10}×4 suits (40 cards total, values 1≤v≤10). - **Player/agent count:** 2 to 8 agents (N∈[2,8]). - **Turn model:** Simultaneous private hand card evaluation followed by simultaneous public showdown. ## Formal rules R1. **Deck Initialization & Dealing:** - Standard multiset D contains 4 copies of each integer k∈{1,2,…,10}. - Pot P is initialized with ante A=1 chip per active agent: P=N⋅A. - Dealer shuffles D uniformly at random and deals 5 private cards Hi={ci,1,ci,2,ci,3,ci,4,ci,5} to each agent i. R2. **Subset Sum Evaluation (Jitgi / 짓기):** - Each agent searches for a 3-card subset {ca,cb,cc}⊂Hi such that: (ca+cb+cc)(mod10)==0 - If no such 3-card subset exists: Hand is invalid (`JitgiFailed`). Hand score Rank(Hi)=−1 (disqualified from pot). R3. **Showdown Hand Ranking (Jokbo):** - If valid 3-card subsets exist, the agent selects the subset that maximizes the value of the remaining two cards {cd,ce}=Hi∖{ca,cb,cc}. - **Tier 1 (Ttaeng / Pairs):** If cd==ce: Rank(Hi)=100+cd (e.g., 10-10=110, 9-9=109,…,1-1=101). - **Tier 2 (Gkeut / Modulo Sums):** If cd≠ce: Rank(Hi)=(cd+ce)(mod10) (e.g., sum remainder 9=9 (Gabo),…,remainder 0=0 (Mangtong)). R4. **Showdown Resolution & Pot Distribution:** - All agents reveal hands simultaneously. - Highest rank value Rankmax=maxi⁡Rank(Hi). - Winning set W={i|Rank(Hi)==Rankmax∧Rankmax≥0}. - If |W|==1: Single winner takes entire pot P. - If |W|>1: Tie! Pot P carries over to next deal. - If |W|==0 (all agents failed Jitgi): Pot P carries over. R5. [gap-fill] Pot Carryover Limit:** If pot carries over for 3 consecutive rounds, a sudden-death high-card single-draw breaks the deadlock. ## Edge cases - Tie at the end condition: Handled by R4 and R5 via pot carryover and high-card sudden-death break. - A player with no legal move: Combinatorial subset selection is deterministic over finite 10-subset search (53)=10. - Repetition / cycles: Bounded; rounds are independent identically distributed deals, and pot carryover limit enforces termination. - Simultaneous claims on the same resource or position: Simultaneous showdown resolves through total order Rank(Hi). - Player elimination mid-round; turn order repair: Chips below ante (Ci<A) eliminates agent from next deal. - Resource exhaustion (pieces, tokens, space, time): Deck contains 40 cards; max 8 players consume 8×5=40 cards (exact exhaustion bound). - Termination guarantee: Enforced by finite chip pools and hard round caps. ## State representation - **Persistent state:** Number of players N, chip stacks {Ci}, current pot P, consecutive tie counter. - **Per-round ephemeral state:** Deck array D, private hands {H1…HN}, calculated ranks {Rank(Hi)}, showdown reveal flags. - **Observable information:** Imperfect information: each agent i observes only private hand Hi and public pot size P. At showdown, all hands are revealed. ## Action space - `commit_hand(c_a, c_b, c_c)`: Select 3 cards to form the multiple of 10 base. Precondition: {ca,cb,cc}⊂Hi. ## Playability notes - Single-player-vs-AI: Fast, addictive poker-style card showdown game; human evaluates hand combinations against AI players. - Group games (n>4): Natively designed for 2 to 8 players around a betting table. - Physical-skill games: Not applicable; pure discrete card combinatorics. - What is lost in the adaptation: The tactile sliding of long, narrow oiled paper slips (*yeot-bangmangi*) between thumb and palms to reveal card pips millimeter by millimeter. ## Implementation hints Extremely low complexity. The hand evaluation requires checking all (53)=10 subsets of 5 integers, which takes <1 microsecond in Python or C. First milestone: implement deck dealing and write a 10-line function to compute the optimal Rank(H) for any 5-card hand.

Download as JSON

Download the full game corpus entry for this game as structured JSON.

Download JSON
Cite this page

Tujeon (South Korea). (n.d.). Games of Countries. https://gamesofcountries.com/games/kr-south-korea/tujeon

@misc{gamesofcountries-kr-south-korea-tujeon,
  title = {Tujeon (South Korea)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/kr-south-korea/tujeon}
}