Add one more level to this by creating the largest loop that you can.
The basic framework above, but also have the last token of the last set overlap with the first token of the first set.
Not thinking of any right off the bat. Perhaps after my coffee I will update this node. Oh wait - "implementation is left as an exercise for the reader." ;-)
It is said that "only perl can parse Perl." I don't even come close until my 3rd cup of coffee. --MidLifeXis
In reply to Re: Multi-token word chains (was The Threeve Game)
by MidLifeXis
in thread The Threeve Game
by pileofrogs
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |