We present a ball game demonstrating a possible gap between truth and provability in arithmetic. The puzzle is solved using König's Lemma on Infinite trees. Further formalisatiom leads to Tarski's inexpressibility of truth, Gödel's first incompleteness theorem and $\omega$-incompleteness of arithmetic.
Only high school level mathematics and familiarity with logical quantifiers like forall, exists and connectives such as negation, implication are assumed.
