Jump to content

Regular constraint

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by TSventon (talk | contribs) at 01:31, 19 July 2025 (logigrams→logigrams{{typo help inline|reason=similar to logograms|date=July 2025}} - toolforge:typos). 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[check spelling].