Queens domination: A mathematical problem originating in chess

What is the smallest number of queens you can place on a standard chessboard so that every square can be reached by moving one queen just once? Using modern computers, this question is easy to answer. But the same simple question for chessboards of arbitrary size has surprisingly not yet been answered. Known as the "Queens Domination Problem," this question has intrigued mathematicians for centuries. Professor Kieka Mynhardt will explain how the movements of chess pieces can lead to a beautiful mathematical theory with problems for which solutions are intriguingly complex.