Monday, January 02, 2017

The Clock Face Routing Puzzle

There is a clock face lying on my table, upon which I have placed cheese on all of the numbers, one through twelve. I have trained a mouse to start by eating all of the cheese from whichever number it pleases, and then to eat all of the cheese of any other number, so long as the new number still has cheese and is either a multiple of, or a divisor of, the number from which it has just come. The mouse continues to run to new numbers with the same restriction. It can never go back to the same number (no cheese there).

My mouse is now smart enough to eat the maximum number of pieces of cheese that it can. How many pieces is that, and what is the order it takes (there are a few solutions for the maximum, not counting just flipping the entire route).


Mike said...

The maximum number is follows:

Yehuda Berlinger said...

Yes indeed. I think "5 10 2 8 4 12 6 3 9" must occur in this (or the reverse) order. "1" can go on either end, and next to the "1" either "11" or "7".

With a 16 number clock, "11" and "13" would be the outliers.

Mike said...

Awesome! Thank you for the opportunity. I really enjoy your blog.