So, I’m trying to make a very simple path finding system for AI with cells instead of nodes. I’m trying to some up with a cell and door system. So, basically it’s cubes that fill up a room set up in a way that each cube has one or more overlapping door cubes. The cubes will have to be set up in a way that from anywhere in the cube, the AI will be able to walk straight at any overlapping door with out collisions. To determine which door to walk towards, each door will have an array with a list of all cell cubes and how many doors you’ll have to go through to get to that cell and then choose the door with the lowest number of doors to go through to get to your goal cell.
here’s a picture to help illustrate what I’m talking about:
So I just need a way of having each door, at the start of the game, compile an array that saves how many doors you’ll have to go through to get to each cell. From there is should be as simple as choosing the door with the smallest number.
Any ideas or any links to node system formulas would be greatly appreciated, thanks.