OK...A friend of mine REALLY needs help on this so it would be much appreciated any ideas. The idea is a rcursive checking algorithm for a set of blocks that when one "falls" it recursively (spelling?) checks all the blocks around it to see if they fell. I am thinking it may be somewhat derived from a tree traversal algorithm but I am not sure. Please help!

*edit* The blocks are set up stacked = <--like that in rows and colums like a matrix. There is no "gravity" just a relationship between the blocks so each block needs to be checked. So now it appears it is more like a list traversal. Still help please!

I think i can get it...can u draw a picture to better illustrate? Sorry, I am a visual guy.

-AntonK

OK nevermind...problem solved. For those of you interested it was a Matrix and you just needed to recursively check the blocks around it when one changed.

Anyway to the Admin: you may take this down now.

We don't typically take down posts.....no point. Someone else may come in, have a similar problem, and now know who to go to.

-AntonK

Yea well in that case so everyone knows, the way the problem was set up it was just like any recursive tree traversal, checking each branch. Thanks anyway.