Here formula_23 players with initial capital formula_24 dollars, respectively, play a sequence of (arbitrary) independent games and win and lose certain amounts of dollars from and to each other according to fixed rules. The sequence of games ends as soon as at least one player is ruined. Standard Markov chain methods can be applied to solve this more general problem in principle, but the computations quickly become prohibitive as soon as the number of players or their initial capitals increase. For formula_25 and large initial capitals formula_26 the solution can be well approximated by using two-dimensional Brownian motion. (For formula_27 this is not possible.)