Math 331: Lecture 1 Queen Problem

Posted on December 25, 2018 by Sumant Sumant


In this lecture Steven talks about the Queen Problem and the Tictactoe problem.
The big idea of this lecture is symmetry and how it reduces the number of cases we have to consider.
The chess problem is about you have n queens and you have n \times n chess board. How many pawns can be placed so that they are not attacked by the queens.

About Sumant Sumant

I love Math and I am always looking forward to collaborate with fellow learners. If you need help learning math then please do contact me.
This entry was posted in Combinatorics, Number Theory, Programming, Symmetry and tagged , . Bookmark the permalink.

Leave a comment