While browsing through xkcd comic strip from the very beginning, I came across this comic strip:

Red spiders.

A question then popped up from my mind:

Imagine in this comic strip that that are many small small cubes "floating" in the vast empty space. Some of the cubes have some red spiders resting or moving on the surface.

At some distance away, say, (x,y,z) since it is a 3D space, there are some red spiders trying to move from one cube to another one, say (x1, y1,z1).

Now, what is the shortest path to reach all the red spiders in the comic strip from (x,y,z)?

.......


Arrggh.

Can do you do it? How?

- comic strip from xkcd

- wong chee tat :)