chanioxaris/kenken-solver

Solves KenKen puzzles, by representing it as a Constraint Satisfaction Problem (CSP)

22
/ 100
Experimental

Implements five CSP-solving algorithms—including backtracking, forward checking, and arc consistency (MAC)—allowing performance comparison across puzzle sizes. Accepts a text-based cage definition format specifying cell coordinates, arithmetic operators, and target sums, then applies constraint propagation techniques to minimize variable assignments during search.

No commits in the last 6 months.

Stale 6m No Package No Dependents
Maintenance 0 / 25
Adoption 6 / 25
Maturity 9 / 25
Community 7 / 25

How are scores calculated?

Stars

24

Forks

2

Language

Python

License

MIT

Last pushed

Mar 25, 2019

Commits (30d)

0

Get this data via API

curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/chanioxaris/kenken-solver"

Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.