People, try this one: "You and your opponent shall play a game with three dice: First, your opponent chooses one of the three dice. Next, you choose one of the remaining two dice. The player who throws the higher number with their chosen dice wins. Now, each dice has three distinct numbers between 1 and 9, with pairs of opposite faces being identical. Design the three dice such that you always win! In other words, no matter which dice your opponent chooses, one of two remaining dice throws a number larger than your opponent, on average."
I thought. I saw the solution. And I have no clue what the solution talks about. Can somebody solve it? or re-state the solution in simple English? Thanks [original at: http://gurmeetsingh.wordpress.com/2008/11/05/puzzle-non-transitive-dice/ I know I shouldn't be copy-pasting like this. But the puzzle is too good] --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
