Question

Place the integers 1, 2, ..., n^2 without duplication in any order onto an n-by-n chessboard, one integer per square. Show that there exist 2 adjacent (vertically, horizontally, or diagonally) entries whose difference is at least n+1.