A web walker is a lot more than just using the A* path finding algorithm, thats only half the battle. You have to create the "Web" itself using the other half which is an edge weighted graph populated with nodes.
Every tile in RS is a Node and the distance between two nodes are the weight associated to that edge. If you have no idea what that is then I would suggest searching up Edge Weighted Graphs first