**Problem of the Week**

**BUGCAT**

**Zassenhaus Conference**

**Hilton Memorial Lecture**

**BingAWM**

**Math Club**

You are here: Homepage » Seminars - Academic year 2023-24 » Combinatorics Seminar » Jeff Nye (Binghamton)

seminars:comb:abstract.201112nye

An n×n magic square has n^{2} 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.

seminars/comb/abstract.201112nye.txt · Last modified: 2020/01/29 14:03 (external edit)

Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 3.0 Unported