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.
albertnez/flow-free
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|
| Name | Name | Last commit date | ||
|---|---|---|---|---|
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.