Tournament of Losers

This title was previously available on NetGalley and is now archived.
Buy on Amazon Buy on BN.com Buy on Bookshop.org
*This page contains affiliate links, so we may earn a small commission when you make a purchase through links on our site at no additional cost to you.
Send NetGalley books directly to your Kindle or Kindle app

1
To read on a Kindle or Kindle app, please add kindle@netgalley.com as an approved email address to receive files in your Amazon account. Click here for step-by-step instructions.
2
Also find your Kindle email address within your Amazon account, and enter it here.
Pub Date Feb 10 2016 | Archive Date Feb 29 2016

Description

All Rath wants is a quiet, peaceful life. Unfortunately, his father brings him too much trouble—and too many debts to pay—for that to ever be possible. When the local crime lord drags Rath out of bed and tells him he has three days to pay his father's latest debt, Rath doesn't know what to do. There's no way to come up with so much money in so little time.

Then a friend poses an idea just ridiculous enough to work: enter the Tournament of Losers, where every seventy-five years, peasants compete for the chance to marry into the noble and royal houses. All competitors are given a stipend to live on for the duration of the tournament—funds enough to cover his father's debt.

All he has to do is win the first few rounds, collect his stipend, and then it's back to trying to live a quiet life...

All Rath wants is a quiet, peaceful life. Unfortunately, his father brings him too much trouble—and too many debts to pay—for that to ever be possible. When the local crime lord drags Rath out of bed...


A Note From the Publisher

Tournament of Losers is a novel of 67,000 words in length and contains some explicit content.

Tournament of Losers is a novel of 67,000 words in length and contains some explicit content.


Available Editions

EDITION Ebook
ISBN 9781620046692
PRICE $6.99 (USD)

Average rating from 24 members


Readers who liked this book also liked: