Return to Question

When trying to program hostile AI units for a war strategy game using pathfinder methods, do programers ever have one Algorythm for the unit to move and a seperate Algorythms for the unit to actively listen for nearbye objectives (ie. opposing warriors, power ups, opposing team's fortress, treasure, etc.

Any insights as to how these methods function would make me happy.

When trying to program hostile AI units for a war strategy game using pathfinder methods, do programmers ever have one algorithm for the unit to move and a separate algorithm for the unit to actively listen for nearby objectives (e.g. opposing warriors, power ups, opposing team's fortress, treasure, etc)?

Any insights as to how these methods function would make me happy.

When trying to program hostile AI units for a war strategy game using pathfinder methods, do programers ever have one Algorythm for the unit to move and a seperate Algorythms for the unit to actively listen for nearbye objectives (ie. opposing warriors, power ups, opposing team's fortress, treasure, etc.

Any insights as to how these methods function would make me happy.

Thanks! Graeme

When trying to program hostile AI units for a war strategy game using pathfinder methods, do programers ever have one Algorythm for the unit to move and a seperate Algorythms for the unit to actively listen for nearbye objectives (ie. opposing warriors, power ups, opposing team's fortress, treasure, etc.

Any insights as to how these methods function would make me happy.