10
. . . 1 . . . . . . 
. . 1 . . . . . . . 
. 1 . . . 2 . . . . 
1 . . . 2 . . . . . 
. . . 2 1 . . . . . 
. . 2 . . 1 . . . . 
. . . . . . 1 . . . 
. . . . . . . 1 . 2 
. . . . . . . . 2 . 
. . . . . . . 2 . . 
% Quasigroup completion problem. 
% This problem file is used by 
% http://www.hakank.org/comet/quasigroup_completion.co
% 
% Problem from http://www.cs.cornell.edu/gomes/QUASIdemo.html
% (n = 10)
% Pattern #1. 
% There are _many_ solutions to this problem.