--- a/projects.html	Tue Jun 12 13:40:40 2012 +0100
+++ b/projects.html	Tue Jun 12 13:49:44 2012 +0100
@@ -43,7 +43,7 @@
   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 (see <a href="http://anytime.cs.umass.edu/aimath06/proceedings/P34.pdf">here</a>) 
+  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>
@@ -282,6 +282,13 @@
   <A HREF="http://webdocs.cs.ualberta.ca/~games/">here</A>. There are
   also some good books about computer players, for example:
   <table>
+  <tr><td><i>Artificial Intelligence: A Modern Approach</i> by S. Russel and P. Norvig, Prentice Hall, 2003. 
+  (standard textbook about search strategies).
+  </td></tr>
+  <tr><td><i>Principles of Artificial Intelligence</i> by N. J. Nilsson, Springer Verlag, 1980. 
+  (standard textbook about search strategies).
+  </td></tr>
+
   <tr><td><i>Computer Game-Playing: Theory and Practice</i> by M. Bramer, Ellis Horwood Ltd, 1983. 
   (Considers techniques used for programming a variety of games: Chess, Go, Scrabble, Billiards, 
    Othello, etc; includes theoretical issues such as game searching)