The number of n-queens configurations
Speaker: Michael Simkin, Harvard CMSA Title: The number of n-queens configurations Abstract: The n-queens problem is to determine Q(n), the number of ways to place n mutually non-threatening queens on an n x n board. The problem has a storied history and was studied by such eminent mathematicians as Gauss and Polya. The problem has also […]