A general pattern-based solver of finite Constraint Satisfaction problems
-
Updated
Nov 2, 2024 - CLIPS
A general pattern-based solver of finite Constraint Satisfaction problems
Examples and large scale studies with the CSP-Rules-V2.1 project
knight's tour puzzle generator
AI for the game Numbrix and Hidato by means of modelling it as a constraint-satisfication problem using BT, FC, GAC with MRV heuristic.
Add a description, image, and links to the numbrix topic page so that developers can more easily learn about it.
To associate your repository with the numbrix topic, visit your repo's landing page and select "manage topics."