int Bunny (foo(foo))

I have done trees in various languages now and this is for C. Not all choices have to be represented in trees and forward and back linked binary trees seems to be a good model to make choices as well as exclude paths that lead to no gain. In the case of a backpack tree, it prunes to a single path through the options to the best goal or one of the equal goal points. It is a little difficult to switch back and forth to Python at first. I can see why some of the choices were made in Python. In the end, it is all machine code.

It would seem that I could devise a fairly simple algorithm for my ants that would evolve over time to the optimum utility for its capabilities and environment. Each time I completely recurse through the code I realize that I have become better at understanding that which was almost voodoo in the beginning. The answer is in its eye.

I think that the tunnels and caves should only have two doors.

typedef struct node {
 int page;
 int mode;
 int keycode;
 void *action;
 struct node* next;
 struct node* next2;//Tree branch binary
 struct node* prev;
} node ;