I plan to implement some form of GP (GeneticProgramming) system. The trees would represent execution trees which means each node in the tree will represent a function, and leaves would represent terminals. An efficient GP system would fail if the tree manipulation operators (crossover, mutation) are slow. -- Regards, Gabi http://bugspy.net