[arutar]

Thanks for sharing such an entertaining problem!

Bonus problem: find an arrangement of 4 queens on the board such that:

1. There is exactly 1 square on which a bishop can be placed, such that the 4 queens and the bishop attack all unoccupied squares

AND

2. There is exactly 1 square on which a rook can be placed, such that the 4 queens and the rook attack all unoccupied squares

Amazingly, modulo rotation / reflection, this problem has exactly 1 solution.