Hacker News with Generative AI: Constraint Programming

Solving Greater Than Sudoku using constraint logic programming (sdymchenko.com)
Greater Than Sudoku (Compdoku) is a variant of sudoku where no initial values are given, but there are greater-than relations inside 3×3 squares that the values must satisfy (the picture from http://avva.livejournal.com/2832977.html):
Grappling with Infinity in Constraint Solvers (tuzz.tech)
Many constraint-satisfaction problems deal with infinity in some shape or form.
Closed Knight's Tour in Prolog (metalevel.at)
This solution uses CLP(ℤ) constraints to model the problem. In particular, the circuit/1 constraint is used to describe a Hamiltonian circuit of the following graph:
A practical introduction to constraint programming using CP-SAT and Python (pganalyze.com)