A Flow Free solver written in prolog using SAT.
It can find the solution that minimizes the longest length, and it can count the number of different solutions.
-
Notifications
You must be signed in to change notification settings - Fork 0
albertnez/flow-free
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Flow Free solver in prolog using SAT
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published