This is probably the toughest puzzle yet so I'll just let the last puzzle keep running a bit longer. Respond to this thread if the puzzle wording is at all unclear.
Face-Up Poker
Ricky and Steve are playing one another in a game of Face Up poker. Ricky is first to act and Steve second. For his starting hand Ricky has 2,598,960 different choices, only some of which would positively secure him the best possible outcome.
So:
Let X = The number of possible starting hands that Ricky could select in order to secure himself the best possible outcome.
Let Y = The highest 5-card card total of all the possible starting hands that Ricky could select in order to secure himself the best possible outcome. (Ignore suits and count Jacks as 11, Queens as 12, Kings as 13, and Aces as 1. For example, 2C 7D 8S KC AH would be a card total of 2+7+8+13+1=31.)
X * Y = ?
<script>var PuzDate='20060715';</script>
<script src=http://btp.sbrforum.com/js/puzzle.js></script>
Face-Up Poker
Originally posted by Rules of Face Up Poker:
So:
Let X = The number of possible starting hands that Ricky could select in order to secure himself the best possible outcome.
Let Y = The highest 5-card card total of all the possible starting hands that Ricky could select in order to secure himself the best possible outcome. (Ignore suits and count Jacks as 11, Queens as 12, Kings as 13, and Aces as 1. For example, 2C 7D 8S KC AH would be a card total of 2+7+8+13+1=31.)
X * Y = ?
<script>var PuzDate='20060715';</script>
<script src=http://btp.sbrforum.com/js/puzzle.js></script>