Im creating a turn based strategy game where the player can build the board over time by placing square tiles. They can rotate them before placing them. Then they will control a character that will navigate this board.
Some tiles are only open on 2 or 3 sides. How could I create a pathfinding system that for example is able to detect that it can only move through the top and bottom of a tile because the tile has walls on the left and right, even though there are tiles adjacent to it on the left and right.
I am planning on using Astar but my issue is that even though 2 tiles are next to each other, I need the algorithm to know it cant direct go onto that tile because the tile its on is not open on that side.
↧