Unique Trees
A puzzle game about rooted trees.
[Oops -- currently, the trivia question is misleading (the actual answer is infinity), because this game uses a different uniqueness requirement than Weak Tree. I hope to patch in the correct algorithm soon.]
Designed for full-screen on web browser or itch app, but you can also play on Android if your screen is large enough to tap small objects, by downloading and installing the .apk file.
Note: This game does not save. But if you save a screenshot, you can easily get back to where you left off.
CONTROLS:
Left-click to grow and cut trees.
INSTRUCTIONS: (click to reveal)
- The goal is to create trees of the given sizes.
- A new tree will unlock when ALL current trees are "valid" (white petals).
- Each tree must be unique. If it contains a previous tree, that part will wither and needs to be changed.
Created for the Confounding Calendar 2024.
Download
Click download now to get access to the following files:
Comments
Log in with itch.io to leave a comment.
really cool idea! i love how much thinking is involved with such a simple puzzle iteration
Nice little math problem, reminds me of the fun bits of math class. Also looks nice. The base game was very solvable but I wasn't expecting the ultra challenge; that really forces you to think about the algorithm.
Why does it feel weird to say that I "100%'d" a Confounding Calendar game? lol
at the beginning i didn’t know about the bonus challenge so i was about to say it was a bit easy, but the bonus challenge was tricky to solve. enjoyed it, and i didn’t really know about what the tree functions were before because the explanations on wikipedia had too much mathematical jargon. this is a good way to explain them
I also greatly this introduction to this topic. perhaps this will allow more people to become involved in and learn about this.
the trees curve too much, it can go offscreen or into adjacent frames
nevermind, you can change the direction by adding and removing branches.
--Spoilers ahead--
As far as I can tell, this can go on infinitely? I know the tree function is not infinite, so there must be a difference between the two. You can see my possibly infinite solution below:
very smart!
the tree(3) problem introduces colors of seeds (different colors of flowers) and also counts additional cases. like if the second tree in your series blue tips and red for the rest, then it would be forbidden for the next one to have blue tips and a red "trunk". imagine it removed the flower in the middle. this type of similar structure would also not be allowed. also remember that it is true in both cases that order maters, ie. it matters which way along a branch is "up".
ah thanks I remember the distinction now
the TREE function also starts with one node (so not even the trunk)
this game is a relaxed version of tree(4) edit: by the game i mean the ultra challenge
note:
TREE(n) starts with one node and you have n colors
tree(n) starts with n+1 nodes and you have 1 color
sorry I only knew the strong tree function, that is what this is a description of.
Nice!
I've completed the ultra challenge by just applying the same algorithm i used in base four. Although I probably misunderstood the trivia question
It was my mistake. Currently, the trivia question's actual answer is infinite, of course.
The infinite algorithm was unintended, resulting from the difference in uniqueness rules between this game and the Weak Tree Function. I'm hoping to patch it out later today.
Oh, so it'll be two puzzles today 😊