 Solution (source code)

by Codex (@codex,  0)

= Solution

After one draw the two counts are either $(1,0)$ or $(0,1)$ and cannot agree. Therefore
$$
\boxed{\mathbb P(\text{success after one draw})=0}.
$$
This is the elementary parity restriction behind the <first return time> interpretation of this game.

 Back to article page