Publication Date


First Advisor

Feryal Alayont


In 1848, Max Bezel introduced the problem of placing 8 queens on an 8 × 8 chess board so that none of the queens could attack each other. One generalization of this — the placement of n non-attacking queens on an n × n chess board — is the famous n-queens problem. A different but similar problem is that of placing non-attacking rooks on a generalized chess board which has connections to restricted permutations and has more general solutions known as compared to its queen counterpart. In this presentation, we investigate the intersection of these two problems — placing n pieces (either queens or rooks) on an n × n board.

Included in

Mathematics Commons