So I've read through "kev"s tutorial on the A* algorithm with tiled maps, and I understand the ideas behind it, but as it seems it is implemented with nodes, one for each tile on the tiled map. I however want my game to have smooth moving, a pixel at the time, and am wondering if this is possible, would it take too much of my CPU to calculate a new path every pixel - and calculate a path with each nodes just being a pixel apart (that'd turn out to be a whole lot of nodes and calculations wouldn't it?). So before I start trying to write it, am I right about this? Would it work? Have you got any other tips on it? It'd be my first time implementing a path finding algorithm (apart from the dijkstra algorithm which I implemented with a perfect node (bus-stop) system for school).
I am also dying to get some aid with the graphics of my latest game. As you can see from the image below my skills with sprites is really awful - and to me Paint just does not seem like the best way to draw them. If anyone has some tips for programs or basics behind making sprites I would very much appreciate that! What should I think about? What tools can I use to make my sprites feel more alive? (Or if anyone already has some basic sprites which I can be allowed to use without me feeling like I'm stealing!)