More about Nimstring, Arrays, Mutations, Vines, etc

More generally we can put in or take out some beads on any Nimstring graph G to obtain mutations of the graph (a bead, of course, is a node with just 2 edges). Figure 28 shows a graph G and two mutations, H and K.