Self-loop detected! Choose an edge (vertex pair).
This edge creates a cycle. You must discard it.
Cost: half your ante
Select an edge that is a bridge (its removal disconnects the graph).
Cards are edges in a graph with 6 vertices (0-5). Build the highest-weight graph without creating cycles.
EDGE ENCODING
Suit = first vertex (♠=0, ♥=1, ♦=2, ♣=3). Rank mod 6 = second vertex. Self-loops are wild (you choose the edge). Weight = ⌈rank/6⌉ (A-6 = 1, 7-Q = 2, K = 2).
ACTIONS
DRAW: Add an edge. If it creates a cycle, you must DISCARD (costs ½ ante). STAND: Lock in your score. REDIRECT: Pay 1× ante to move one endpoint of a drawn card (once per hand). BRIDGE: Declare an edge is a bridge. Correct = double its weight. Wrong = lose 1× ante.
| Result | Payout |
|---|---|
| Spanning Tree (5 edges, connected) | 3:1 |
| Higher Weight | 1:1 |
| Dealer Busts (cycle) | 1:1 |
| Tie | Push |
| Lower Weight | -ante |
| Both Bust | Push |
SIDE BETS
| Bet | Condition | Pay |
|---|---|---|
| EULER | Euler path exists | 2:1 |
| REGULAR | All non-isolated vertices same degree | 15:1 |
| ISOLATED | 2+ vertices with degree 0 | 5:1 |
DEALER RULES
Dealer draws up to 4 edges. Does NOT discard — a cycle means dealer busts.
Your balance hit zero. Time to reload.