Place the integers (without duplication) on an chessboard, with one integer per square. Show that there exist two adjacent entries such that their difference is at least . (Adjacent means horizontally, vertically or diagonally adjacent.)
I tried using "extreme principle" but that doesn't lead me anywhere. Any ideas?