Tree(3)

Tree(3) is a puzzle game built on one of the largest numbers in mathematics. You build a sequence of small trees, one at a time. Each tree may use one more node than the last, and its nodes come in three colors. There is one rule: no earlier tree may ever be found inside a later one. The moment a shape repeats, the sequence ends. Kruskal's tree theorem proves every such sequence must end. TREE(3) is how long the longest one could run — a number so large it cannot be written down in the observable universe. Your score is how far you get before the rule catches you. MAIN GAME — Pure TREE(3). Start from a single node and extend as far as you can. Every game is a new best-score attempt. PUZZLES — A position and a bank of candidate trees. Pick the ones that don't repeat an earlier shape. Three tiers; the skill is reading embeddings at a glance. DAILY — One puzzle a day, the same for…