quote:Originally posted by Azat: Okay, create a grid on a football field. 5 by 5. 25 equal squares. If you draw this grid, the square in the upper left-hand corner we could say is one, and the one next to it is two, three, four, five, and then the line below that is six, seven, eight, nine, 10, 11, 12... All the way to 25. Now put a person in each square. You have to move each person from the square they are into the square of one of his adjacent squares. So number one can move to square number two, or number six, for example. Number two can move to number one. Or number three, or number seven. So, here's the question. What is the fewest number of total moves that will allow every person to move to an adjacent square? Azat jan, i didn't understand this one. what is it asking for?