clpfd

Constraint Logic Programming over Finite Domains

Explore on GitHub Read Hacker News discussions

2Distinct people

2Mentions

1Explicit recommenders

195GitHub stars

REPOSITORY AT A GLANCE

What to know before exploring

What it is

Constraint Logic Programming over Finite Domains

GitHub

Where it is used

No documented product use has been verified yet.

What people are saying

My favorite way to solve constraint satisfaction problems is by using the the excellent CLP(FD) or CLP(Z) libraries for Prolog. A sudoku solver can be written in just a few…

cbarrick used a recommendation phrase. One indexed comment matches. This is a phrase match, not a verdict.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 3:56:07 PM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by year2 dated mentions

Observed mentions: 2017-04-11 21:11:29 UTC to 2021-10-11 17:20:44 UTC.

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges

UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
Period	Start (UTC)	End (exclusive, UTC)	Mentions	Comments
2017	2017-01-01 00:00:00 UTC	2018-01-01 00:00:00 UTC	1	1
2018	2018-01-01 00:00:00 UTC	2019-01-01 00:00:00 UTC	0	0
2019	2019-01-01 00:00:00 UTC	2020-01-01 00:00:00 UTC	0	0
2020	2020-01-01 00:00:00 UTC	2021-01-01 00:00:00 UTC	0	0
2021	2021-01-01 00:00:00 UTC	2022-01-01 00:00:00 UTC	1	1

What Hacker News says

2 sources

cbarrick·Oct 11, 2021Recommendation phrase

My favorite way to solve constraint satisfaction problems is by using the the excellent CLP(FD) or CLP(Z) libraries for Prolog. A sudoku solver can be written in just a few lines [1]. [1]: https://github.com/triska/clpfd/blob/master/sudoku.pl

In How to Solve the Sudoku Puzzle with Programming

carapace·Apr 11, 2017

That's very kind of you. Your comment made my day! :-) I came to Logic Programming via grokking mrocklin's port of Kanren to Python: https://github.com/logpy/logpy; and to solving logic puzzles via Laws of Form: http://www.markability.net/ (Last year the author of that site George Burnett-Stuart apparently cracked how to encode Predicate Calculus in the notation, which is an exciting development, IMHO!) So I'm not a complete novice. That said, at first I thought I should define relations like smokes and pet_of, but somehow between seeing the table on the Wikipedia entry for the Zebra Puzzle and the SEND MORE MONEY example (https://github.com/triska/clpfd/blob/master/sendmory.pl) it became obvious what to do. If you look at the SEND MORE MONEY solution you'll see the Zebra solution is laid out just like it. To me, it seems like the

Read the rest

same sort of puzzle as Sudoku, but much simpler. It's unfortunate that the solution and the solving proper (querying for the result) obscure the art of the puzzle-maker, eh? Thanks for the suggestion! I've incorporated it into the version in Github "gist": https://gist.github.com/calroc/603ed919bc814ccee10c1b3df6142... (I kept the more verbose query though, as I think the output is nicer. :-) YMMV)

In The Power of Prolog