Is it possible to fill a grid with the integers from 1 to 9 (using each only once) so that no two adjacent squares (sharing a side or a corner) contain consecutive integers?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
If we look at the square: we can see that there is a square in the middle, which borders all of the adjacent squares, therefore if we were to put any integer n from 1 to 9 , there is an n - 1 and/or an n + 1 which must also be included in one of the boxes surrounding the middle box, and if the middle box touches all of the boxes surrounding it, it must touch the number(s) that lie consecutive to it.