Jump to content

Regular constraint

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Michael Hardy (talk | contribs) at 06:49, 11 March 2010 (initial context-setting; lower case required by WP:MOS). 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.