Yep ... I think it is referred to as "recursion".
I became aware of of recursive functions in an old chess program in which the function calls itself (without getting trapped in an endless loop). The recursions get more time consuming as you step outwards one level ... logrithmically in a sense.
What was not available a couple of years ago, that is available today -- is the raw computing power and the hardware to accomodate this type of process. A lot of things are going to open up to the SE's to analyze every day from now on. They can go ahead and develop deep logic algorithms to sniff out just about anything they put their minds to.
Quote:
|
Originally Posted by jbgilbert
Gosh, I just found out by reading a single post in an open forum.....duh
|
Yep! If you are onto a good scheme (good or bad), best to keep it to yourself and not mention it. Gloating in public will definitely put you back to square one.