Consider a wooden 5x5x5 block. A termite wishes to eat the block in the following way

1) It starts with an external, central 1x1x1 cube of any face.
2) The termite eats it, and the heads towards a neighboring 1x1x1 cube.
3) It repeats step 2 until it can't go any further.

Determine:

a) A possible path for the termite to follow, in order to eat every single 1x1x1 cube.

b) If it's possible for the termite to eat all 1x1x1 cubes, knowing it ate the central internal cube last.

(In reply to re: Logic? by Gamer)

If there were a category for graph theory that's where it would belong. I doubt that we'll ever have enough graph theory problems to justify a separate category, tho.

Of the existing categories, I would suggest either General or Geometry.

Posted by TomM on 2003-05-12 20:58:32