Free-Man Chess

Obj: +1 structure recognition at speed — where is our spare man, where is theirs, and how both change every second. Field: 35×30yd. Equip: Cones, ball, bibs. Org: 7v6 possession — but every 2 minutes the coach silently swaps a player between teams (7v6 becomes 6v7 without announcement). The possession team must detect the new math from play alone and adapt: with +1, find the free man and dominate; at –1, tempo up, risk down, use the GK-equivalent anchor player (one designated "safe" player defenders can't press full-out — the escape valve, rotating). Points standard, but conceding possession while at +1 costs double (spare-man waste taxed). CP: (1) Count constantly — the free man is a calculation, not a memory; (2) at +1: patience, the extra man WILL appear if you move the ball faster than they shift; (3) at –1: honesty — smaller ambitions, sharper execution, protect the anchor. Prog: Two silent swaps per round; no anchor at –1 (full honesty). Reg: Swaps announced; 8v6. Mist: P: playing identical football at +1 and –1 (the adaptation IS the session); C: swapping the same players (everyone experiences both maths). Time: 16 min. Out: Numerical-state detection within ~30 seconds; state-appropriate play. Var: Match-state layer: coach announces the scoreboard too ("–1 and losing, 8 minutes left" — 37/38 curriculum bridge). Diag: Rectangle with player-count annotations 7v6, swap arrow moving one player across, thought-bubble "+1?" over the carrier.