why havent u used quick-union or quick-find algorithm for the maze solution? Dijkstra seems too "top-level" for solving a maze to me.

Thanks for ur feedback and this goldstar-thing :P I think ill do a Football game in this next time i have too much freetime, but there are much other projects like my android game (which is alike a mixture of badlands, doodlejump & flappy bird) or my work or my School :D only@danpost: i only implemented the standingOnSmth() because i wanted to show the reusability in other games. U can see the standingOnSmth() is implemented in the Man.class so it isnt necessary for the engine. The aspect in this scenario was to give a quite easy and clean base of a physics engine like i explained (thats why i named the methods exactly alike the things they do).

Nice to know u like it. I used it for testing movement algorithms for my big project (but its written in android api). Try all the other keys and u will get interesting effects :) http://www.directupload.net/file/d/3678/ng8uyurg_png.htm