Jump to content

Regular constraint

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Jesse V. (talk | contribs) at 09:58, 11 February 2013 (tags and general fixes, added orphan tag using AWB (8853)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In artificial intelligence and operations research, 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.