Regular constraint
From Wikipedia, the free encyclopedia
In artificial intelligence and operations research, a regular constraint[1] is a kind of global constraint. It can be used to solve a particular type of puzzle called a nonogram or logigrams[check spelling].
