Message Font: Serif | Sans-Serif
No. of Recommendations: 0
I don't have the official answer to the problem. I should have it by Sunday when it's revealed.

But like both of you, I tried to solve it and couldn't find an answer assuming single occupancy for each spot. I would assume that's what the author meant. What makes it impossible, the way I looked at it, is that there is an odd number of neighbors. You can think of the moves as "pairings". For each neighbor that moves, there is necessary one that has to leave for another spot. That's a pair. This makes it necessary that the total number of neighbors must be even. Odd x even = even. Even x even = even. Given that there is 25, this isn't possible. Maybe this is the correct answer to the puzzle.

The only other possibility is that the author of the puzzle is allowing the neighbors to move more than once, and if allowing for that, what is the minimum number of moves? Given this possibility, I would say rotate the outer ring of the array clock or counter clockwise. Same with inner ring that surrounds the center neighbor. That produces 24 moves. Now swap spots between center and one of its neighbors top/bottom etc. that produces 26 moves. One neighbor moves twice, but all others once.
Print the post  


What was Your Dumbest Investment?
Share it with us -- and learn from others' stories of flubs.
When Life Gives You Lemons
We all have had hardships and made poor decisions. The important thing is how we respond and grow. Read the story of a Fool who started from nothing, and looks to gain everything.
Contact Us
Contact Customer Service and other Fool departments here.
Work for Fools?
Winner of the Washingtonian great places to work, and Glassdoor #1 Company to Work For 2015! Have access to all of TMF's online and email products for FREE, and be paid for your contributions to TMF! Click the link and start your Fool career.