Update

Implemented a makeshift algorithm for my ranged vision hoppers. Bot uses a basic heuristic (for diagonal movement on grid map) from Amit Patel's A* heuristics page to calculate the target cell within the range of vision. It then tries to find shortest path to the cell, and then move along that path. If no path is found then the bot will try and move in the default direction of the global target and then again try and find a path to (a new probably) target cell. Yes, not very bright. A better algorithm is needed and fast. Gotta meet him this week ASAP.