Abstract

This disclosure describes a ball game in which an automated caller announces, before each strike, the name of the player who must receive next. Receivers are chosen by a shuffle bag: each round is a fresh random permutation of the roster, so every player receives equally often per round in an order players cannot anticipate. The sequence is a deterministic function of the roster and a seed declared before play, so anyone can recompute a session and verify the distribution; devices stay consistent by sharing only a call count, the round index persists across sessions, and no per-player record is kept. In the net form the caller designates receivers on both sides, removing the option of targeting a weaker opponent. A point is a completed pass and reception credited to no individual; cooperative play counts a streak up, competitive play counts down to zero, and handicaps are unequal starting scores quantized to multiples of three. By default each name is spoken privately to one rotating human announcer on a single device; alternatively, synchronized phones speak every name in one synthetic voice, never a player's own recording, with owner-approved recordings or respellings controlling pronunciation. Difficulty is the interval between announcement and ball arrival; scoring is inferred from the call or validated by microphones or a ball accelerometer. Stated limits: no pre-registered prediction has been run; enjoyment, the premise that being named by another matters, and synchronized-phone audio are unproven; order predictability at small group sizes is bounded, not eliminated.

Creative Commons License

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.

Download

Share

COinS