There are 25 jealous people who live in the squares of a five-by-five grid. We’re going to number the squares, starting in the upper left-hand corner, 1 through 25.

So the first row starts with 1, the second row starts with 6, the third row starts with 11, and so forth. Remember, each person is jealous of his adjacent neighbor. Not his diagonal neighbor, but the person up or down or left or right of him. Each aspires to move into the apartment of his adjacent neighbor.

The question is very simple: What is the fewest number of total moves that can accomplish this?

Warning: Use of undefined constant bfa_comments - assumed 'bfa_comments' (this will throw an Error in a future version of PHP) in/home/customer/www/riddledude.com/public_html/wp-content/themes/atahualpa/comments.phpon line132one move

Nope, keep trying.

25