http://code.activestate.com/recipes/tags/constraint/views/2013-01-12T05:26:55-08:00ActiveState Code Recipes2013-01-12T05:26:55-08:00Eviatar Bachhttp://code.activestate.com/recipes/users/4184885/http://code.activestate.com/recipes/578414-takuzu-solver/

<p style="color: grey"> Python recipe 578414 by <a href="/recipes/users/4184885/">Eviatar Bach</a> (<a href="/recipes/tags/constraint/">constraint</a>, <a href="/recipes/tags/constraint_solver/">constraint_solver</a>, <a href="/recipes/tags/puzzle/">puzzle</a>, <a href="/recipes/tags/takuzu/">takuzu</a>). Revision 2. </p> <p>A Takuzu solver implemented using Google's Constraint Programming solver, part of the or-tools project.</p> <p>A Takuzu board consists of a square grid of binary cells. There must be an equal number of 0s and 1s in every row and column, no duplicate rows or columns, and no more than two of the same bit consecutive in every row and column.</p>