Although Gambler's Ruin has been around for 350 years and is still used in many books to illustrate the Markov Chain concept, very few authors have considered extensions to more than 2 players. Historically, the 2-player problem is associated with many illustrious names, including John, James and Nicholas Bernoulli, DeMoivre, Feller, Fermat, Huyghens, Laplace, Lagrange, Pascal & others. In our paper k players each start with the same number of coins c and we bring together and study about a dozen different strategies for ruining every player except the overall winner, all accomplished with completely fair games and at most one coin at risk per game for each player. Many new exact results and tabled comparisons are included along with (1) a novel application of Gambler's Ruin to problems of ranking and selection and (2) new techniques for getting exact results for expectation & variance from difference equations.