Single Comment

Contest: the 9 Queens Problem. Put 9 queens and 1 or 2 pawns such that queens do not see each other. Send your solution before Feb 29, and win a book![All Comments] [Add Comment or Rating]

Doug Chatham wrote on Sat, Jan 10, 2004 10:22 PM UTC:

Well, there are <i>many</i> alternative problems we could look at. For example, replace the Queens with Amazons. (See <a href='http://www.durangobill.com/N_Queens.html'>http://www.durangobill.com/N_Queens.html </a>for some results on putting n Amazons --he calls them Superqueens -- on an nxn board, with no pawns.)<p> For more problems involving combinations on chessboards, see <blockquote>S.M. Hedetniemi, S.T. Hedetniemi and R. Reynolds, Combinatorial problems on chessboards: II, Chapter 6 in Domination in Graphs: Advanced Topics, T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Eds., Marcel Dekker, New York, 133-162 (1998). </blockquote>