Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

Jump to content

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

References

[edit]
  1. Hague, Matthew; Jeż, Artur; Lin, Anthony Widjaja; Markgraf, Oliver; Rümmer, Philipp (9 October 2025). "The Power of Regular Constraint Propagation". dl.acm.org. ACM Digital Library. pp. 387:3203–387:3231. doi:10.1145/3763165. Retrieved 2 December 2025.