--- a/projects.html	Thu May 24 12:37:49 2012 +0100
+++ b/projects.html	Tue Jun 12 13:40:40 2012 +0100
@@ -43,7 +43,8 @@
   is a computationally hard problem (<A HREF="http://en.wikipedia.org/wiki/NP-complete">NP-complete</A>), 
   modern SAT-solvers routinely solve boolean formulas with 100,000 and more variables. 
   Application areas of SAT-solver are manifold: they range from hardware verification to 
-  Sudoku solvers. Every 2 years there is a competition of the best SAT-solvers in the world.</p> 
+  Sudoku solvers (see <a href="http://anytime.cs.umass.edu/aimath06/proceedings/P34.pdf">here</a>) 
+  Every 2 years there is a competition of the best SAT-solvers in the world.</p> 
 
   <p>
   Most SAT-solvers are written in C. The aim of this project is to design and implement