A. Teitelman of Israel and Ross Millikan of San Mateo CA showed that a maximum of 14 non-attacking bishops could be placed on the board. Jean Moreau de Saint-Martin of Paris (France), Claudio Baiocchi of Gavignano (Italy), Ignacio Larrosa Cañestro of Coruña (Spain), Matt Hudelson of Washington State University, Benjamin Phillabaum, a graduate student in physics at Purdue University, and John Snyder of Oconomowoc WI also showed that there were 256 possible arrangements of the bishops.
More generally, on an n×n board, there are a maximum of 2n − 2 non-attacking bishops and 2n arrangements of them.
Here is Ignacio Larrosa Cañestro's solution:
The black squares of the board are arranged in a diagonal and three 'rectangles', each of which may be visited by a bishop bouncing off the edges of the board. You can place a bishop on either end of the diagonal and in any two opposite corners of each rectangle. Thus we have 2^4 = 16 possibilities. For the white squares have other 16 chances, independent of the above. Therefore, in total there are 16*16 = 256 possible configurations, with a maximum of 14 bishops who do not threaten each other.