Sponsored by the Rutgers University Department of Mathematics and the
Center for Discrete Mathematics and Theoretical Computer Science (DIMACS)

Doron Zeilberger, Rutgers University, zeilberg {at} math [dot] rutgers [dot] edu
Nathan Fox, Rutgers University, fox {at} math [dot] rutgers [dot] edu)

Title: A Complex KenKen Classification

Speaker: David Nacin, William Paterson University

Date: Thursday, December 8, 2016 5:00pm

Location: Hill Center, Room 705, Rutgers University, Busch Campus, Piscataway, NJ


In the blog bit-player, Brian Hayes presented a KenKen puzzle over the complex numbers and stated that the uniqueness had not yet been checked. We present a proof of uniqueness and the classification of all four-by-four puzzles with unique solutions over all possible cage patterns. This result was originally done entirely in Python. It also follows from the work we present here, which involves the interactions between group actions on the sets of all possible puzzles and the set of order four Latin squares.

See: http://www.math.rutgers.edu/~nhf12/expmath/