Jump to content

Regular constraint

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Cesium 133 (talk | contribs) at 22:46, 10 March 2010 (double-stubbed the article... cleaned it up some, too). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In constraint satisfaction, a regular constraint is a kind of global constraint. It can be used to solve a particular type of puzzle called a nonogram or logigrams.