Author |
Topic: The mouse in the cheese cube (Read 1680 times) |
|
Bitrot
Newbie
Posts: 5
|
 |
The mouse in the cheese cube
« on: Jul 20th, 2004, 8:39pm » |
 Quote  Modify
|
So there's a mouse on a 3x3x3 compound-cheese-cube. He starts at a corner and works his way through, eating blocks of cheese. In the original problem, we were asked if a mouse could eat all the subcubes and end at the center; this was actually on my graph theory final! But that mouse is not very interesting; let us consider the plight of his mentally deficient sibling.
This mouse was the runt of the litter, and he didn't turn out too bright (but he's very nice). As a result, he must make a ninety-degree turn after each block of cheese that he eats. He still can't backtrack into where he's already been. How many cubes of cheese out of the 27 can he eat before he has to stop? What about for n>3? Non-cubes?
Can you prove optimality without brute-force?
|
|
 IP Logged |
|
|
|
|
RIDDLES SITE
WRITE MATH!
Home 
Help 
Search 
Members 
Login 
Register
Reply
Notify of replies
Send Topic
Print