Live data from Hacker News

Seven Puzzles You Think You Must Not Have Heard Correctly (2006) [pdf]

math.dartmouth.edu

41–50 of 220 posts

Re: Seven Puzzles You Think You Must Not Have Heard Correctly (2006) [pdf]

#41
post #40

The 'dot-town suicides' is a more general version of a puzzle I know, "The Island with Blue-Eyed People". The solution is an induction, which is unusual in these kinds of problems.

Why can't the visitor say "There are X red, X blue, and 1 yellow?" No one knows about the yellow, thinks it is themself, they all commit suicide on the spot.

That sounds about right. But the problem statement doesn't permit the information to be a lie? The info could be "somebody has blue eyes!"

Re: Seven Puzzles You Think You Must Not Have Heard Correctly (2006) [pdf]

#42
post #34

Earlier quoted context omitted.

I don't know, why would someone steal a padlock unless it was attached to a box? Maybe so, though.

The wording of the problem is "anything sent through the mail will be stolen unless it is enclosed in a padlocked box".

Jan constructs an enormous box around the entire country of Kleptopia, and places his own padlock on it from the inside. Then he mails the ring with no additional security measures.

The problem is fatally flawed by not explicitly stating that boxes locked with padlocks are also not stolen, despite not being enclosed in a padlocked box.

Re: Seven Puzzles You Think You Must Not Have Heard Correctly (2006) [pdf]

#43
post #38

Earlier quoted context omitted.

Do you have any intuition to why it helps to build the query sequence on the data? It seems natural that if you have to plan the queries for everybody in advance, you can't do better than 2^(-100) or perhaps (50!)^2/100!. Yet somehow by using the return values to find our next query point we can do much better. Blows my mind.

Each individual still has a ~50% chance of being unable to find their name using the query sequence protocol. By agreeing to the same query sequence their success modes and failure modes are now linked. If there's a cycle of 51 or greater, all of those individuals in that cycle are guaranteed to fail, while if they're in a cycle of 50 or less, all of those individuals are guaranteed to succeed. What this protocol doe…

You are right, but we can also agree on a common query sequence in advance that doesn't use the 'results' of the queries. What about using what we find makes this so much more efficient?

Re: Seven Puzzles You Think You Must Not Have Heard Correctly (2006) [pdf]

#44
One that I heard last week: There is an 8x8 checkerboard in a room with a coin placed on each square. Each coin is either facing heads or tails up, and the face is determined randomly. Before you can inspect the board, a "master" comes in, picks a square of interest, and must make a manipulation to the board by flipping one of the 64 coins. He then exits the room. You are now allowed to enter, and must read out which square of interest the master chose by inspecting the state of the board. There is a strategy that is guaranteed to work for all possible configurations of the board.

Re: Seven Puzzles You Think You Must Not Have Heard Correctly (2006) [pdf]

#45

The 'dot-town suicides' is a more general version of a puzzle I know, "The Island with Blue-Eyed People". The solution is an induction, which is unusual in these kinds of problems.

Yeah, it's an old chestnut:

https://en.wikipedia.org/wiki/Common_knowledge_(logic)

Spivak has a version of it in his Calculus book, phrased as 17 (heh!) professors who must resign if a flaw is found in their published work (hehehe), and all have a flaw in their papers, known to each other except each author.

Re: Seven Puzzles You Think You Must Not Have Heard Correctly (2006) [pdf]

#49

One that I heard last week: There is an 8x8 checkerboard in a room with a coin placed on each square. Each coin is either facing heads or tails up, and the face is determined randomly. Before you can inspect the board, a "master" comes in, picks a square of interest, and must make a manipulation to the board by flipping one of the 64 coins. He then exits the room. You are now allowed to enter, and must read out which…

Either I'm somehow missing some critical piece of this puzzle or your description is. The master could pick a square at random, leaving you with a board (and likelihood of success) that is still completely random.

Are you supposed to be collaborating with the "master"?

Re: Seven Puzzles You Think You Must Not Have Heard Correctly (2006) [pdf]

#50

One that I heard last week: There is an 8x8 checkerboard in a room with a coin placed on each square. Each coin is either facing heads or tails up, and the face is determined randomly. Before you can inspect the board, a "master" comes in, picks a square of interest, and must make a manipulation to the board by flipping one of the 64 coins. He then exits the room. You are now allowed to enter, and must read out which…

I think you're referring to this puzzle: http://datagenetics.com/blog/december12014/index.html

The version you gave is missing information and so can't be solved as stated.

Post reply on HN