Skip to content

N-Prolog ver4.21

Choose a tag to compare

View all tags
@sasagawa888 sasagawa888 released this 16 May 23:30
v4.21
58c45a6

N-Prolog ver4.21 Release Notes

Main Updates

Improvements to CLP(FD)

  • In this version, free variables are now supported in the Constraint Logic Programming over Finite Domains (CLP(FD)) system.
  • As a result, N-Prolog now shows reasonably competitive performance compared to SWI-Prolog on simple problems such as magic squares.

Heuristic Optimization Not Yet Implemented

  • Heuristic techniques for narrowing the search space are not yet implemented.
  • Currently, the system performs near-exhaustive search, making it less suitable for more complex problems.
  • We plan to explore heuristic approaches in future improvements.

On Usage

  • The current CLP(FD) implementation is sufficient for experimentation, learning, and casual use.
  • It is well-suited for verifying simple or puzzle-like constraint problems.

Originally Planned Features Completed

The following features that were originally planned have been mostly completed in version 4.21:

  • GUI integration
  • TCP/IP communication support

Future Plans

  • No major new features are planned for the time being, as the focus will shift to stability and bug fixes.

Request for Feedback

  • If you discover any bugs or issues, we would be grateful if you could report them.
Assets 2
Loading