Jump to content

Regular constraint

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Gzorg (talk | contribs) at 20:26, 2 March 2010. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In constraint satisfaction, a regular constaint is a kind of global constraint. It can be used to solve a particular type of puzzle called nonogram or logigrams.


This article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Regular_constraint&oldid=347361550"