[stefanhendriks]

I don't know how to handle complex jump situations yet. As the current 'path walk' function only takes care of a distance check in some sort so it does not really care if the node is more up or down.

The BIT_JUMP makes the bot force to jump when stuck only. It does not make the jump before-hand. I think 2 new bits should be introduced for complex jumping:

BIT_JUMPSTART
BIT_JUMPEND

so:

Node A->B->C

when you have to jump from A to C via B. Then Node A should have a JUMP_START and B a JUMP_START and JUMP_END thingy. Node C only a JUMP_END.

When the path_walk function finds a JUMP_START at the current node and a JUMP_END at the other, it should somehow make sure that it jumps on node B. It requires other demands to know if the bot IS at Node B, and not only its distance, but also on height.

Hmm, still pondering about it.