Nebu: Give me an Xbox360 for $300.

Mathy: Finish this puzzle. http://supuzzle.com/

Nebu: I think it's impossible.

Mathy: Why?

Nebu: They're asking for a 3-3 bipartite graph which is planar.

Mathy: Me no speak geekanese.

Nebu: Wikipedia: Complete Bipartite Graph, Wikipedia: Planar Graph Note in the Planar_graph article, they specifically list a 3-3 bipartite graph as being non-planar, in the bottom right picture.

Now, back to you: Give me an Xbox360 for $300.

Mathy:

its not really a puzzle, as in they aren't being truthful. the puzzle isn't just figuring out how to connect them but how to manipulate the program to allow you to connect them even though it is impossible.

Nebu: So the puzzle is to find the bug in the program?

Mathy: An exploit.

Nebu: Haha, I tried something like that, but I didn't think to jump through the icon. I tried jumping off the screen, but it wouldn't let me. There's actually a wikipedia article on the puzzle itself: Wikipedia: Water, Gas, and Electricity

[K3,3 is not planar, ] But K3,3 is toroidal[...] In terms of the three cottage problem this means the problem can be solved by punching a hole through the plane (or the sphere).

So you could solve this puzzle on a piece of paper, instead of in a buggy flash.

Mathy: hehe

Nebu: That'd be a cool party trick. Bring a piece of paper, ask peopel to solve it, and when they can't, solve it by punching a hole in the paper. I AM SURE YOU WILL PICK UP TONS OF CHICKS USING THIS TECHNIQUE!!!

Mathy: Hell yeah.