How many different ways are there to fill a grid with 1 and 0, such that the diagonals have no 0?
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.
Since the diagonals have no 0 , they must all be 1 :
This leaves 8 squares that can be either 0 or 1 , for a total of 2 8 = 2 5 6 different ways.