fuc…I miss that combo. U are right. It’s to perfect and simple to be true. Second one… I don’t know what to say…only I can take my hat off. Thanks De…

I not have more ideas for #1 Can you show mystery code and “lo” method

#1>>> fn getRootGroupHead node = if isValidNode node do ( while node != undefined and (isgrouphead node.parent or isgroupmember node) do no…

We already tried with recursive function

Thanks. I like this kind of stuff.

I can’t find mini-challenge #1. Search Forum find only #2 and above challenges.

Here we go again:) My head still hurts from “group” thread. Can we start discussion (6 pages min)?

Also looking this tool there are more randomization methods. Who knows how to create Solid, Chaos I and Chaos II functions.

Animare: Hi all, Just wondering is it possible to use an array count to a random function. E.G MyArray =#(A,B,C,D) Random 1 MyArray.cont…

Thanks to Denis this thread has been turned into a battlefield. If you want to learn something really cool and useful U need to jump here and survive.

Another functions fn[b] getRootGroupHead[/b] node = if isgroupMember node do ( while node != undefined and (isgrouphead nod…

This is my final attempt fn getRootGroupHead node = if isgroupMember node do ( while node != undefined and (isgrouphead node.parent or isg…

Yes if is nested

miauu: Just a shot in the darkness Ok. Good night to both of you. Good night friend

Why do we need other nodes when you look for GroupHead. Your first function is better then last one ei. it’s the same. Denis did not surrender