Skip to main content
Formal Specification

Tip-Cat (Bigézés / Kánfázás) — Formal Specification

Hungary · dexterity-throw · Confidence: high

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: probabilistic-proxyGap-fills: 3
# Bigézés — AI-optimized specification ## General idea A traditional two-phase projectile game where an agent initiates a pop-up launch on a double-tapered wooden peg and strikes it mid-air for distance, followed by a fielding counter-throw and a bluffing/estimation distance bidding phase. The strategic depth combines fine-motor strike timing with psychological distance bluffing against opponent challenge thresholds. ## Formal model - **Abstraction taken:** The physical double-strike (pop-up tap + mid-air bat swing) is modeled as a compound stochastic check parameterized by agent hand-eye dexterity. Field flight distance `D` is sampled from `f(power, angle, dexterity)`. Return throw accuracy and distance bidding are discrete decision nodes. - **Player/agent count:** 2 agents (Striker `S`, Fielder `F`) or 2 small teams. - **Turn model:** Strictly sequential multi-step round cycle: Strike Phase → Field/Return Phase → Bidding/Scoring Phase. ## Formal rules R1. Setup: Peg at origin `(0,0)`. Starting target ring radius `R = 0.5m`. Scores initialized to 0. Target score `W = 100`. R2. Strike Phase: Striker `S` attempts `double_strike()`. - Pop-up probability: `P(popup) = skill_s`. If fail, attempts remaining decrements (max 3 attempts). - Air-strike outcome: Flight distance `D ~ Normal(mu_power, sigma)`, landing at `(x_peg, y_peg)`. R3. Air Catch Resolution: Fielder `F` positioned in field has catch probability `P(catch) = f(distance_to_landing)`. If caught, Striker `S` is OUT; roles swap immediately. R4. Return Throw Phase: If uncaught, Fielder `F` executes `throw_return()`. - Return landing error `E ~ Rayleigh(sigma_throw)`. - If distance from return landing to origin `< R` (target hit), Striker `S` is OUT; roles swap immediately. R5. Bidding & Scoring Phase: Remaining distance `D_rem = distance((x_peg_return, y_peg_return), origin) / bat_length`. - Striker `S` submits bid integer `B >= 1`. - Fielder `F` chooses `accept_bid` or `challenge_bid`. - If `accept_bid`: `score_S += B`. - If `challenge_bid`: - If `B <= D_rem`: `score_S += B` [gap-fill: or `score_S += floor(D_rem)`]. - If `B > D_rem`: `score_S += 0`, and Striker `S` is OUT; roles swap. R6. [gap-fill] Turn concludes; if Striker `S` was not put out, `S` retains the striker role for the next turn. R7. End Condition: First agent to reach `score >= W` wins immediately. ## Edge cases - Tie at the end condition: Not applicable — turns are sequential; first agent to cross target score threshold `W` wins immediately. - A player with no legal move: Not applicable — active agent always has an action (strike, throw, bid, or challenge). - Repetition / cycles: Bounded because missed bids or successful fielder throws cause role swaps; points strictly accumulate toward `W`. - Simultaneous claims on the same resource or position: Turns and actions are strictly sequential. - Player elimination mid-round: When playing in teams, an out rotates the batting queue to the next teammate; when all team members are out, fielding and batting roles swap. - Resource exhaustion (pieces, tokens, space, time): Single peg and bat in play. Maximum turns per game capped at 50 [gap-fill]. - Termination guarantee: Guaranteed by monotonic score progression and non-zero probability of successful strikes/bids each round. ## State representation - Persistent state: `score_S`, `score_F`, `active_striker_id`, `active_fielder_id`, `target_score_W`. - Per-round ephemeral state: `strike_attempts_left`, `peg_coords (x,y)`, `peg_in_flight (bool)`, `current_bid_B`, `measured_distance_D`. - Observable information: Fully observable distances and scores. Private bids are revealed sequentially. ## Action space - Striker: `strike(aim_angle, power_ratio)`, `call_bid(distance_int)`. - Fielder: `position_field(x, y)`, `throw_return(aim_x, aim_y, power)`, `accept_bid()`, `challenge_bid()`. ## Playability notes - Single-player-vs-AI: Natural and engaging — human plays against AI bidding agent using distance calculation heuristics. - Group games (n>4): Reduces cleanly to 1v1 duel or two alternating teams of fielders/batters. - Physical-skill games: Double-strike timing abstracted into skill parameters; distance estimation bluffing preserves high strategic depth. - What is lost: The physical hand-eye challenge of connecting with a spinning peg mid-drop. ## Implementation hints Low complexity. The most interesting algorithmic component is the Fielder's challenge decision function: a Bayesian estimator comparing the Striker's bid against the perceived distance distribution. Suggested first milestone: implement R1–R7 with deterministic distances to test bidding logic before attaching stochastic strike physics.

Download as JSON

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

Download JSON
Cite this page

Tip-Cat (Bigézés / Kánfázás) (Hungary). (n.d.). Games of Countries. https://gamesofcountries.com/games/hu-hungary/bigezes

@misc{gamesofcountries-hu-hungary-bigezes,
  title = {Tip-Cat (Bigézés / Kánfázás) (Hungary)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/hu-hungary/bigezes}
}