Skip to content

N-Prolog ver4.10

Choose a tag to compare

@sasagawa888 sasagawa888 released this 08 May 03:13

N-Prolog ver4.10 Release Notes

We are excited to announce the release of N-Prolog ver4.10! This version introduces CLPFD (Constraint Logic Programming over Finite Domains), allowing for efficient solving of constraint satisfaction problems (CSPs). With this new feature, problems such as the N-Queens problem and other simple examples can now be solved.

It's still at a toy level. It's far from being practical.

Key Changes:

  • Introduction of CLPFD: Support for constraint logic programming over finite integer domains.
    • Examples: N-Queens problem, Sudoku, solving linear equations, etc.
    • Basic constraints like #=, #<, and in are now supported.
  • Example Problems: Simple examples, such as the N-Queens problem, are now solvable.
    • Sample code demonstrating how to solve basic constraint problems is included.
  • Updated Documentation: Details about CLPFD are available in document/CLPFD.md.

Still Under Improvement:

Further improvements and feature additions are underway. This includes performance enhancements and the addition of more constraint types.

Bug Reports:

If you encounter any bugs or issues with the new features, please report them. Feedback from the community will help drive further improvements.