Problem: Show how to place floor((2n+1)/3) non-attacking queens on a triangular board of side n. Show that this is the maximum possible number of queens.

< - Home page (anti spam-bot feature) © 2004, Gabriel Nivasch