But is it possible though?
Consider the following diagram. Can you connect each small box on the top with its same-letter mate on the bottom with paths that
do not cross
one another,
nor leave
the boundaries of the large box?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 solution
At first it seems impossible, but let's be optimistic and assume that it is possible. The problem seems unwieldy, so it's a good idea to try to loosen up and make the problem trivially easy:
Now we can try to "push" the floating boxes back to their original positions, one at a time. First the A box:
Now the C box: