This is another beauty of a puzzle from A Moscow Math Circle: Week by Week Problems by Sergey Dorichenko.
The numbers from 1 to 64 have been placed in each square on a chessboard such that each number appears exactly once. Prove that there will be two squares sharing an edge whose numbers will differ by more than 4.
As always, please send your answers as comments within the blog (preferred), or send an e-mail to alokgoyal_2001@yahoo.com. Please do share the puzzle with others if you like, and please also send puzzles that you have come across that you think I can share in this blog.
Happy Eid!
Alok Goyal's Puzzles Page 
From square marked 1 to square marked 64, the maximum manhattan distance possible between the two squares is 14. Since 63/14>4, there has to be at least one step where the jump is greater than 4. Hence proved.