Hi!
I’m currently part of project group, writing a shoot 'em up java 2D game. Using the A* algorithm, I managed to sort out the basic enemy pathfinding, and they have no problem finding the players position and start attacking. While implementing the pathfinding, I didn’t take into account that the actual enemies would have collision boxes, not just a position to keep track of, resulting in a enemy behavior that doesn’t handle walls very well.
Basically, the calculated path is correct, but since the enemy only makes sure their upper left corner (their position) never enter a wall-tile, problems occur when any other corner is the one close to the walls. I don’t really know how to handle this, and would be grateful for any tips I could get.