2024-02-06 01:39:58 +00:00
|
|
|
# uckf
|
|
|
|
|
|
2024-02-06 03:16:41 +00:00
|
|
|
A deeply unsatisfying word search.
|
|
|
|
|
|
|
|
|
|
## Usage
|
|
|
|
|
|
|
|
|
|
1. [install the Go compiler](https://go.dev/dl/) if you don't have it yet
|
|
|
|
|
2. clone this repo (`git clone https://git.chromaticdragon.app/kistaro/uckf.git`)
|
|
|
|
|
3. `go run uckf.go`
|
2024-02-06 04:04:51 +00:00
|
|
|
4. you can use `-n` to specify a different grid size; for example, `go run uckf.go -n 100` will create a 100x100 unsatisfying word search
|
|
|
|
|
|
|
|
|
|
### Flags
|
|
|
|
|
|
|
|
|
|
* `-n <int>` -- use a grid with edges of length n
|
|
|
|
|
* `-s` -- summary mode; do not print intermediate grids, only summaries
|
|
|
|
|
* `-r=false` -- suppress final result (only print a summary for that)
|
2024-02-06 03:16:41 +00:00
|
|
|
|
|
|
|
|
## Notes
|
|
|
|
|
|
|
|
|
|
This algorithm converges much more quickly than I expected.
|
