2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/160149We determine the behavior of Tanton's candy-passing game for all distributions of at least 3n-2 candies, where n is the number of students. Specifically, we show that the configuration of candy in such a game eventually becomes fixed.3 pages; edited in response to referee's commentsCombinatorics37B15, 05C38 (Primary); 05C35 (Secondary)text