Using CSP heuristics
-
Updated
May 2, 2018 - Python
Using CSP heuristics
kakuro (simple version) solver as CSP problem - Artificial Intelligence course project - Spring 2021
Implementation of CSP heuristics and various algorithms for solving magnet puzzle
Annual legislative scorecard maps for the Maryland League of Conservation Voters
A CSP approach to solve magnet puzzle problem
Final Project in AI Course, HUJI
This project implements a Constraint Satisfaction Problem (CSP) solver for logic grid puzzles written in natural language. The solver automatically extracts entities and clues from the puzzle text, converts them into formal constraints, and finds a valid solution using classical CSP techniques.
Solving Sudoku puzzle with CSP
Add a description, image, and links to the lcv topic page so that developers can more easily learn about it.
To associate your repository with the lcv topic, visit your repo's landing page and select "manage topics."