Generator for trees logic puzzles.
Requires Uiua v0.10.
Below is an example puzzle.
The rules are as follows:
- Each square either contains a "tree" or does not contain a tree (there is no significance to the object in question being a "tree," it is really just an arbitrary object occupying one cell).
- Every row, every column, and every colored region contains exactly one tree.
- Two trees cannot be adjacent to each other, even diagonally.
Since this specific puzzle is 8x8, there are a total of 8 trees; solve the puzzle by finding them.
Generate an 8x8 puzzle and play it with the app.
uiua gen.ua 8
uiua app.ua
Generates an NxN puzzle and writes it to file
.
N
defaults to5
file
defaults toout.csv
uiua gen.ua [N] [file]
Requires raylib pointed to by
RAYLIB_PATH
.
Starts the interactive app with the puzzle in file
.
file
defaults toout.csv
uiua app.ua [file]
In the app, left/right click on squares to cycle between eliminated
(-
) and tree (T
). Press space to reroll the colorscheme.
If img
is provided, outputs a png of the puzzle in puz
to the filename img
.
Otherwise, outputs an image of the puzzle in puz
to the terminal.
puz
defaults toout.csv
uiua img.ua [puz] [img]