I looked around online and the description of the game in this article is inaccurate. When a head is severed the only node that is duplicated is the parent to t

I looked around online and the description of the game in this article is inaccurate. When a head is severed the only node that is duplicated is the parent to the head (along with all its remaining children). I originally believe that all children of the head's grandparent were to be copied. Go to the node right below the node connected to the severed head—labelled in purple in the diagram—and reproduce n copies of all the nodes and the segments above the selected node. Compared to http://googology.wikia.com/wiki/Kirby-Paris_hydra http://googology.wikia.com/wiki/Kirby-Paris_hydra We start with a finite rooted tree T. Call its root R. Jonathan picks a leaf vertex of the tree and a natural number N. Call the leaf A and its parent B: A is deleted from T. If B = R, nothing happens. Otherwise, let C be the parent of B. Consider the subtree consisting of B and all its children; copy this subtree N times. Attach all these copies to C.