Skip to main content

Indie game storeFree gamesFun gamesHorror games
Game developmentAssetsComics
SalesBundles
Jobs
TagsGame Engines
(+3)

--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

(1 edit)

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.