Regular constraint
From Wikipedia the free encyclopedia
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.
External links
[edit]
 | This artificial intelligence-related article is a stub. You can help Wikipedia by expanding it. |
 | This applied mathematics–related article is a stub. You can help Wikipedia by expanding it. |