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. - Foolman---------------I used a different move pattern to arrive at the same answer of 26 moves. I was in the process of posting a solution when I realized that when that last guy moves, either he or whoever he swaps with ends up in a spot that was not one of his adjacent neighbors before anybody moved. One of them ends up in a diagonal spot from his original position. So with that, I came to the conclusion the problem as stated has no solution.Your rotating rings approach was very creative but I think it leads to this same problem. You have the center guy, swap up or down, so after the move the intial center guy is OK. But the guy he swapped with used to be diagonal from that center before the inner ring rotated so although he moved twice, he remains jealous.I am anxious to hear the published answer. Good puzzle. Thanks for posting.
Best Of |
Favorites & Replies |
Start a New Board |
My Fool |
BATS data provided in real-time. NYSE, NASDAQ and NYSEMKT data delayed 15 minutes.
Real-Time prices provided by BATS. Market data provided by Interactive Data.
Company fundamental data provided by Morningstar. Earnings Estimates, Analyst Ra