====== Jeff Nye (Binghamton) ======

====== Computational Techniques for Magic Square Enumeration ======

===== Abstract for the Combinatorics Seminar 2011 December 6 =====

An n×n magic square has n<sup>2</sup> distinct positive integers such that row, column, and diagonal sums are equal. Counting the number of magic squares for a given magic sum is difficult. Constraint programming offers a simple way to enumerate them directly, listing all magic squares. I'll show how to do this for 3×3 squares.


----