Can anybody provide me with the pseudocode for A*? I've been trying to learn from tutorials, but found them to hard to follow.

There is pseudo-code in the Wikipedia article about A* search... Is there anything wrong with it? Perhaps you can explain what part of what you have read you don't understand.

http://www.policyalmanac.org/games/aStarTutorial.htm

this is a pretty simple and solid tutorial, it's what i used to initially learn the algorithm.

If the thousands of A* tutorials (complete with pseudocode) already on the internet can't help you, why should a fresh summary here help you any better?

I recently post the code of my implementation in c.
The most useful links (besides wikipedia):
http://www.policyalmanac.org/games/aStarTutorial.htm
http://www-cs-students.stanford.edu/~amitp/gameprog.html#paths

You can find my post with the code, limitations etc, here:
http://16bitsflag.blogspot.com.br/2012/09/a-implementation-for-grids-in-c.html

Good luck.