UVictoria Mathematics Colloquium: Candida Bowtell

Back in 1848, in a German chess magazine, Max Bezzel asked how many ways there are to place 8 queens on a chessboard so that no two queens can attack one another. This question caught the attention of many, including Gauss, and was subsequently generalised. What if we want to place n non-attacking queens on an n by n chessboard? What if we embed the chessboard on the surface of a torus? How many ways are there to do this? It turns out these questions are hard, but mathematically interesting, and many different strategies have been used to attack them. This talk will discuss some of the approaches taken to make progress on such problems, as well as highlighting how many problems still remain open.