Jump to content

Regular constraint

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Gzorg (talk | contribs) at 20:22, 2 March 2010 (Created page with 'In constraint satisfaction, a '''regular constaint''' is a kind of global constraint. It can be used to solve a particular type of puzzle called [[nonogram]...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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