https://github.com/dheeraj135/flow-free-solver
Solver for [Flow Free App](https://play.google.com/store/apps/details?id=com.bigduckgames.flow&hl=en_IN&gl=US)
https://github.com/dheeraj135/flow-free-solver
Last synced: 3 months ago
JSON representation
Solver for [Flow Free App](https://play.google.com/store/apps/details?id=com.bigduckgames.flow&hl=en_IN&gl=US)
- Host: GitHub
- URL: https://github.com/dheeraj135/flow-free-solver
- Owner: dheeraj135
- License: apache-2.0
- Created: 2020-12-09T11:00:03.000Z (over 4 years ago)
- Default Branch: main
- Last Pushed: 2020-12-10T19:14:52.000Z (over 4 years ago)
- Last Synced: 2025-01-04T20:17:07.944Z (5 months ago)
- Language: Python
- Size: 11.7 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
## Flow Free Solver
### Required Conditions:
1. Each grid box have exactly one color.
2. We can have a grid of size N * M * num_colors * type.
3. We have two types of nodes, Endpoint and Connection Node.
4. We need seperate grid for each color because we can only store boolean value in SAT.
5. Now, we can have the end points as connected.
6. For now, let's assume only one pair of color exists.
7. Now, we need to write condition for connected wires.
### Conditions for the connected Wires:
1. Please find the conditions here: https://mzucker.github.io/2016/09/02/eating-sat-flavored-crow.html
Right Now I am not clearing up invalid loops. I don't understand how we can remove loops using N^2 additionals variables. I am thinking about solving it using incremental algorithm similiar to what I did in the mastermind problem.
### Future Plans:
1. GUI or React.js based frontend to simplify and beautify the input-output process.
2. Remove the loops.