1. Yato T and Seta T. Complexity and Completeness of Finding another Solution and its Application to Puzzles. In: Proceedings of the National Meeting of the Information Processing Society of Japan, IPSJ, Japan, 2002 (SIG Notes IPSJ-2002-AL-87-2)
2. Pegg E. Enumerating Sudoku Variations, available at http://www.maa.org/editorial/mathgames/mathgames_09_05_05.html, 2005
3. Dotu I., del Val A and Cebrian M. Redundant modeling for the quasigroup completion problem. In: Rossi, F. (ed.), Principles and Practice of Constraint Programming (CP 2003), Springer-Verlag, Berlin, 2003, pp 288-302 (Volume 2833 of Lecture Notes in Computer Science)
4. Gomes C and Shmoys D. The Promise of LP to Boost CP Techniques for Combinatorial Problems. In: Jussien N and Laburthe F (eds.), Proceedings of the
5. Simonis H. Sudoku as a constraint problem. In: Hnich B, Prosser P and Smith B(eds.) Modelling and Reformulating Constraint Satisfaction Problems,Proceedings of the Fourth International Workshop, CP, 2005, pp 13-27