Figure 6
Schematic representation of the worm algorithm: (a) starting configuration; (b) random generation of the worm, which terminates when it crosses itself; (c) only the loop section of the worm is retained; (d) pairs are flipped along the worm, giving rise to the new configuration. In (a,d), only pairs before and after flipping are coloured by red and blue.
