Let's solve some constraint-satisfaction problems (AIMA ch. 6).
Details
Ryan's pet problem is the zebra problem (AIMA 6.7): he recommended it as a good way to compare strategies and possibly introduce some Prolog.
Martin mentioned he'd like to implement a type system with CSP someday.
In any case, let's experiment with k-consistency, backtracking, etc.