We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
Published online by Cambridge University Press: 01 August 2016
A topic of current interest is that of finding defining sets (preferably smallest defining sets) for various combinatorial structures such as latin squares and block designs, so it seemed interesting (though of no practical use) to try to solve the same problem for magic squares of small size. (The germ of this idea was suggested in the Gazette Note [1] of 1988 under the sub-heading ‘Squares from clues’.)
