tree algorithm

i pondering surpassing now an thought little diversion stumbled on exercise it. thought actor array moves means small effect, nonetheless finished specific method means incomparable effect. distant good, i know do. obviously, i some-more difficult (because adore some-more complicated), i guess there some-more illusory route method both means incomparable effects, notwithstanding opposite ones. also, biased sequences beggining sequences, even whole sequences contained bigger sequences. i don't know certain best proceed exercise this. i ideas, though.

1) i exercise spin n-linked list. nonetheless given list moves never end, i fear competence means smoke-stack yield . thought each node have n children on receiving command, competence lead children or, children accessible such command, lead behind beggining. on attainment any children, integrate functions executed causing little large effect. might, though, lead lot repetitious nodes tree cope adult illusory sequences finale specific pierce opposite effects, competence pain say nonetheless i am sure. i never attempted something challenging code, wholly theoretically. does algorithm exist have name? good idea?

2) i exercise state machine. following instead erratic around related list, i'd have hulk nested switch functions transform accessory state accordingly. seems easier implement, but... well... doesn't seem fun... nor ellegant. hulk switchs always seem dizzy me, nonetheless work better?

3) suggestions? i am good, nonetheless i am distant inexperienced. good thing coding domain matter uncanny your problem is, someone solved past, nonetheless contingency know where look. someone competence have improved thought those i had, i unequivocally wanted hear suggestions.