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.