Since we seem to be short on questions about questions, here is another one:
You are a prince that is about to be married to another country. The country has three princesses. You are allowed to chose which princes to marry (but not to marry more or less than one).
One of the princesses always lies, one always tells the truth and one can answer whatever she feels like.
You have heard a rumor that the king of the other country already has given his favorite princess away to someone. You conclude that in order to keep your head, you should avoid choosing that princes. The rumor also says that the favorite princes is the one that can chose as she pleases.
How many yes/no questions do you need to ask the princesses in order to keep your head?
And a bonus one that some of you already know the answer to:
You are a rude warrior that needs to pass two men. One always tells the truth and the other always lies. They wont let you pass until you have figured out who is the lying one. What is the fastest way to do so?
One based on a failed assumption of mine:
You have glass tiles made of Unobtainuim. As they are hit, they absorb 50 % of the impact. How many such tiles do you need to stop a jumbojet? Assume full physical realism (Earth and reasonable flight height), aside from the Unobtainium.
And here is one I made up today:
You are an alien corespondent. The aliens have a similar numerical system to us, but they uses other symbols. You have gotten access to a standard 4 function calculator. Find the algorithm that determinates what weights each symbol has.
Bonus complication 1:
Make the algorithm do no assumptions about the number of symbols.
Bonus complication 2:
Some symbols are duplicates.
Bonus complication 3:
Some weights lack a symbol.
Bonus complication 4:
Some weights are fractions.
And since we where talking dies:
You are a manufacturer of biased dies. Your client has asked for a set of biased dies for a
Yahtzee style game using an alien numerical system as above. But you don't know the system more than the symbols used.
Investigate if there is a solution where you are only allowed to make one set of dies, yet can grantee a cheating result. You are allowed to provide the client with an exact algorithm for how to play the game with these biased dies.
The result is considered cheating if you get a better score if you know how the dies are loaded than if you had played optimally assuming that they where fair.
[/URL]
Guess who got into the Flash credits?