The super queen problem

In Unit 15, we look at permutation matrices. Permutation matrices solve the n-rook problem. The n-queen problem is harder: we have to find a permutation matrix such that if 1's are queens, no queen can hit the other. You will explore this experimentally. Here is a new problem. The super n-queen problem is even harder. A super queen is a queen with special powers. It can also jump like a horse. For n=10, there is up to symmetry a unique super n-queen configuration. A super queen can attack everything in taxi distance 3 or less. One can now ask for configurations of super duper queens which can attack everything in distance k or less: Twitter. Click for a 3600 x 2700 pixel version. We used chess Povray macros written by Ville Saari in 1991.