A* with wall based tiles

[sproket]

Hi guys,

I've been trying to build a path finder for my game. As you can see by the pic below, this is using walls instead of simple blocks. I'm not sure how this is affecting the algorithm.  Samples I've seen use tiles where each coordinate is either blocked or not. In my case each coordinate may be blocked only from a particular direction.

Any tips on how I could do the algorithm differently?

[sproingie]

A* should still work the same.  When you generate the neighbors, you just exclude any for which there's a wall in the way.

[Best Username Ever]

The algorithm itself does not need to be changed. A-star can work on any type of graph. A grid is a graph. Graphs have nodes and edges. Nodes are the places your search algorithm can visit. Edges are the connections between nodes.

Empty grids have graphs like this:

1   2   3   4   5   6   7

+E+E+E+E+E+E+E+E+E+E+ E E E E E E E E E E E +E+E+E+E+E+E+E+E+E+E+ E E E E E E E E E E E +E+E+E+E+E+E+E+E+E+E+ E E E E E E E E E E E +E+E+E+E+E+E+E+E+E+E+

Grids with occupied squares have graphs like this

1   2   3   4   5   6   7

+E+E+E+E+E+E+E+E+E+E+ E E E   E E E E E E E +E+E+   +E+E+E+E+E+E+ E E E   E E E   E E E +E+E+E+E+E+E+   +E+E+ E E E E E E E   E E E +E+E+E+E+E+E+E+E+E+E+

Grids with walls on their cell edges have graphs like this:

1   2   3   4   5   6   7

+E+E+E+E+ +E+E+E+E+E+ E E E E E E E E E E E +E+E+ +E+ +E+ +E+E+E+ E E E E E E E E E E E +E+E+ +E+ +E+ +E+E+E+ E E E E E E E E E E E +E+E+ +E+E+E+ +E+E+E+

When adding nodes to the list you add the neighboring node

if(!grid.edgeBlocked(currentCell, aNeighbor) && !grid.isOccupied(aNeighbor))

instead of

if(!grid.isOccupied(aNeighbor))

Games published by our own members! Check 'em out!

[sproket]

OK thanks.   That means I just have normal bugs but I don't have to tweak the algorithm itself.

[Roquen]

Another common option is to have weights for cells..and unpassables have very high weights (just additive values).

[kulpae]

The problem with high weights for impassable cells is that A* will take these cells if there is no other way to get in. e.g. if the target lies in an isolated area. If this behaviour isn't desired, then it's better to not include these impassable cells, as sproingie and Best Username Ever already said.

[Roquen]

Context dependent, but a very good point.  I was thinking in terms of weights related to movement cost, so it isn't possible (well...unless you support a god mode) in that case.  Of course there's the pruning issue as well.  Ignore me and move along.