  In this work we count the number of satisfying states of triangulations of a
convex n-gon using the transfer matrix method. We show an exponential (in n)
lower bound. We also give the exact formula for the number of satisfying states
of a strip of triangles.
