Walking Algorithm

To get from point A to point B:

Take a step in the general direction of point B. If you are not at point B yet, after a pause for thought, apply the algorithm again.

This works best when the direction chosen is aproximately toward your chosen destination. However anything within a 180 degree arc will work with some success.

Bear this technique in mind when tripping heavily. You don't need to know C or Java. Being able to stand up is a good start.

Here's how I do it

public void walk(point b) throws FellDownException {
if(currentposition == b)
return;
else
if(seeSomethingMoreInteresting(eyes))
return;
else{
if(!hipsFacing(b))
turnHipsTowards(b)
takeStep((lastfoot == rightfoot)?leftfoot:rightfoot));
}
walk(b);
}

Of course this algorithm contains no instructions for avoiding obstacles. Hence I'm not that great a walker.