News for hackers. Stuff that matters.
Re:Monty Hall problem explained visually by drblast on Monday December 16, 2013 @01:48PM (#6916895)
The two envelopes paradox is a good one:

http://consc.net/papers/envelope.html

And another that I've figured out the "right" answer to but think there might be more to it is this:

Suppose I set up a two-player game as follows:

  1. One player is the "odd" player, the other is
  the "even" player.

  2. Each player may choose a single number per turn,
  either one or two.

  3. The result of each turn is the sum of the two players'
  choices.  For example, if the even player picks 1 and the
  odd player picks 2, the result of that turn is 3.

  4. If the result is odd, the even player pays the odd
  player that amount, and vice-versa.  In our example 
  result of 3, the even player would pay the odd player 3
  dollars.
Question: Is this game fair? If not, is it possible to give either player a per-turn stipend to make the game fair? If so, how much is that amount?
Re:Monty Hall problem explained visually by tomca32 on Monday December 16, 2013 @02:07PM (#6917044)
I'll bite.

I guess that the odd player can always choose 1. In that case he can either win 3 or lose 2. Making that the favorable choice for the odd player.

Even player could always choose 2 in which case he can either win 4 or lose 3. Making this the favorable choice for the even player. However, if both players play their favorable choice, odd player always wins: 2 + 1 = 3.

I'm not sure if I got this right, but that's my thinking so far...

Re:Monty Hall problem explained visually by drblast on Monday December 16, 2013 @06:24PM (#6918574)
Here's a hint; is there a strategy one player can play such that no matter what the other player does, the first will win money on average?