Harlequin's Forum Posts

  • Problem solved.

    7Soul

    worked perfectly, thanks!

  • So I have multiple copies of an object overlapping and I want to pick the one with the lowest instance variable. Any ideas?

  • You could use built-in pathfinding behavior, I recall they added features to support movement cost.

    I've had a look at the pathfinding demo and it's not quite what I'm after. It seems that they create an event based on overlapping with an obstacle sprite and then reduce the maximum speed of the moving unit. The path cost feature seems to encourage a path to be avoided rather than making the path not possible. Also it seems to cut corners even with diagonals disabled.

    Can I restrict the pathfinding movement to move in only 90 degree angles and not allow movement to a destination if the path cost value exceeds a threshold?

  • Try Construct 3

    Develop games in your browser. Powerful, performant & highly capable.

    Try Now Construct 3 users don't see these ads

  • Hi all,

    I've been playing around with c2 for a few weeks now and would like to attempt making a turn based strategy.

    Thats a bit broad so let me narrow it down. A turn based strategy similar to Advance Wars takes into account immovable terrain and terrian with varying cost.

    I've been told in order to workout how far a unit/character can move on a square grid based map with terrain penalties I would need to use Dijkstra's Algorithm.

    I'm scratching my head at how to implement this as I'm finding it difficult to understand the psuedo code.

    cprogramming.com/tutorial/computersciencetheory/dijkstra.html

    Can someone help explain this to me or point me at a simpler psuedo code for Dijkstra's Algorithm.