Can this particular game be beaten

I don’t know the name of it, but you draw 3 circles and 3 squares on a sheet of paper in any design you want. Then you have a draw a line connecting each circle to all 3 squares, but none of the lines you draw (they do not need to be straight lines) can cross each other. Everytime I and other have tried to play it you always end up having one line that you can’t get because it overlaps another line.

So is there a solution to that game, or a name for it? Is there some mathematical principle behind it since you always end up one line short?

No, it’s not possible. Also called the “gas, water, electric” problem.

Graph theory - the K3,3 graph is not embeddable in the plane.

Oh, and wiki has an article on it:

There’s a cheat. You can do it by drawing a connecting line through one of the circles or squares.

I think it can be beaten if you roll the paper into a cylinder.

Bend it around to form a torus, and you got it.

What about a Möbius strip?

That will work, too.

And a sphere as well.

No, embedability on a sphere is equivalent to a plane.

:smack:

I blame all the video games played on toroidal worlds.

That’s not a cheat. It’s the answer. The problem always forgets that the math only works with points.

A simple proof that it can’t be done on a sphere (and, thus not on a piece of paper, or such things), in the sense in which it can’t be done:

First, pick six points on the sphere, call half of them circle-points and the other half square-points, and draw any loop you like that goes through all of the points, comprising six of the desired connections. So long as the loop doesn’t intersect itself, it splits the sphere into precisely two regions.

There are three more connections to be made, and each time you add them, so long as you avoid intersecting other connections, you will split precisely one region into two. Thus, after you finish, if you’ve avoided intersections, there will be five regions.

But, as each of the 9 connections will border precisely 2 of the 5 regions, this means the average number of connections comprising the border of a region will be 9 * 2 / 5 = 3.6. This means there would have to be some region with less than 4 connections in its border.

But that’s not possible! A border is a loop, and thus must keep alternating between the circle-points and the square-points; thus, it must be made of an even number of connections. And you can’t have just 2 connections in a loop (the second would just be the first in reverse…). So the smallest border possible is made out of 4 connections.

Thus, it is not possible to avoid intersections when connecting three circle-points to three square-points a la the OP on the surface of the Earth.