There are 25 jealous people who live in the squares of a five-by-five grid. We're gonna 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?
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