I realize you get tons of these messages. However, nowhere I have been able to find a tutorial for this even though it's, I think, quite a common problem.
I develop a tile-based turn-based strategy game. When the player selects a unit, the tiles where the unit is able to move to get highlighted like on the following picture.
Each unit has its own movement points (for example 50) and every tile has its movement cost (grass 10, forest 20, ...) Also, when the unit walks diagonally, the cost is multiplied by 1.42 (When a unit crosses to forest, the step costs 20*1.42.)
The code I am using, however, works for small distances only. When I select a unit with, let's say 120 movement points, it takes up to 2 seconds to display the possible tiles. That's too slow.
Here's the code I am using:
private void FloodFill(Node node, Unit u, float energyremains, bool view, bool beginnode, bool diagonal)
{
// node - The tile on which stands the unit
// energyremains - initially the energy of the unit, it gets lower and lower with recursion
// view - no longer used, assume always false
// begin node - currently examined node is the node on which stands the unit
if ((!node.Occupied ) || beginnode)
{
float oldenergy = energyremains;
/* no longer needed
if (view)
{
float difficulty = node.Seedifficulty;
if (diagonal) { difficulty = (difficulty * 1.42f); }
node.Shrouded = false;
if (energyremains >= difficulty)
{
if (!beginnode)
energyremains -= difficulty;
}
else
{
return;
}
}*/
else if (!beginnode)
{
float difficulty = node.GetWalkDifficulty(u);
if (diagonal) { difficulty = (difficulty * 1.42f); }
if (energyremains >= difficulty)
{
node.Reachable = true;
// If a node is reachable, it means it is highlighted and the unit can get there.
energyremains -= difficulty;
}
else
{
return;
}
}
You don't have even to look at my code.
I ask you only to give me a better solution to the problem, an effective solution to the problem, if exists.
Thanks in advance.
Each unit has its own movement points (for example 50) and every tile has its movement cost (grass 10, forest 20, ...) Also, when the unit walks diagonally, the cost is multiplied by 1.42 (When a unit crosses to forest, the step costs 20*1.42.)
The code I am using, however, works for small distances only. When I select a unit with, let's say 120 movement points, it takes up to 2 seconds to display the possible tiles. That's too slow.
Here's the code I am using:
