Show HN: Selen – Constraint Satisfaction Solver in Rust
github.comThis project originated from my need for a constraint solver in a cutting optimization project. After evaluating existing solvers, which were primarily bindings to large C/C++ libraries with numerous dependencies, I decided to develop my own solution. Over several years, I experimented with various approaches, resulting in a self-contained implementation.
The solver handles constraints with integer, float, and boolean domains, supporting arithmetic, logical, and several global constraints (alldiff, element, count, table).
While performance continues to improve, it is not intended to compete with large commercial solvers. Libraries in other languages usually pass to optimized libraries in C. Is it faster than Numpy and similar then? As I already stated the reason is "bindings to large C/C++ libraries with numerous dependencies" for other libraries and "it is not intended to compete with large commercial solvers".
I didn't do comparison, but it will be helpfull to compare and tell us.