(S): If A < B, then A is added to the row in the leftmost position, (C): If A > B, then both cards are removed.
(A is also dealt into the row when at the moment there are no other cards on the table.)
We argue that the chance to finish the game with no cards on the table is equal to the return probability for the standard random walk.
More generally, we discuss large-n asymptotics for the output configuration viewed as (i) a set, (ii) an involution, (iii) a lattice path or (iv) an interacting particle system.
Last Updated: October 12, 2001