Question

Niklaus Wirth introduced the software engineering concept of stepwise refinement through developing an ALGOL program for this problem. Donald Knuth’s paper on “Algorithm X” uses the dancing links technique to quickly solve various tiling problems as well as this problem, which is a case of a generalized exact cover problem. Dijkstra’s “Notes on Structured Programming” ends by deriving a backtracking algorithm to solve this problem. This problem (-5[1])has solutions for all positive integers (15[1])n except 2 and 3, and when n is (*) 8, there are 92 solutions including rotations and reflections. The standard algorithm for this problem runs a depth-first search to place the namesake objects one row (10[1])at a time while avoiding reusing any diagonal. For 10 points, name this problem of placing certain pieces on a chessboard so they don’t (10[1])attack (-5[1])each other. ■END■ (10[1]0[1])

Back to tossups