Jump to content

Regular constraint

From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Dege31 (talk | contribs) at 22:26, 20 July 2025 (Added {{Unreferenced}} tag). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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].

[edit]