Skip to main content
Game Development

Return to Question

Tweeted twitter.com/#!/StackGameDev/status/371966927255916544
Changed the title and edited the question correcting stylistic errors.
Source Link
edit approved Aug 26, 2013 at 11:10
Mikolaj Marcisz
edit approved Aug 26, 2013 at 11:10
Mikolaj Marcisz
  • 2k
  • 3
  • 16
  • 27

Pathfinding with Are there any pathfinding algorithms that would handle different movementsmovement types?

I'm developing a bot for a BattleTech board game simulator http://en.wikipedia.org/wiki/BattleTech, it is turn based.

BoardThe board is divided ininto hexagons, each one havehas a different terrain type and elevation. You drive a robot wichwhich moves over them, to destroy other robots.

I only know Dijkstra and A* pathfinding algorithms, but the problem is that there are 3 types of movements: walk, run and jump several hexagons (each of them have their own rules). Walk and run are almost the same.

The best path could be a combination or each movement type. Here is an example of map http://megamek.info/sites/default/files/isometric_view.png

And my question: Do you know a good algorithm for this complex pathfinding or a way to combine A* results for each movement type?Do you know a good algorithm for this complex pathfinding or a way to combine A results for each movement type?*

Pathfinding with different movements types

I'm developing a bot for a BattleTech board game simulator http://en.wikipedia.org/wiki/BattleTech, is turn based.

Board is divided in hexagons, each one have a different terrain type and elevation. You drive a robot wich moves over them to destroy other robots.

I only know Dijkstra and A* pathfinding algorithms, but the problem is that there are 3 types of movements: walk, run and jump several hexagons (each of them have their own rules). Walk and run are almost the same.

The best path could be a combination or each movement type. Here is an example of map http://megamek.info/sites/default/files/isometric_view.png

And my question: Do you know a good algorithm for this complex pathfinding or a way to combine A* results for each movement type?

Are there any pathfinding algorithms that would handle different movement types?

I'm developing a bot for a BattleTech board game simulator http://en.wikipedia.org/wiki/BattleTech, it is turn based.

The board is divided into hexagons, each one has a different terrain type and elevation. You drive a robot which moves over them, to destroy other robots.

I only know Dijkstra and A* pathfinding algorithms, but the problem is that there are 3 types of movements: walk, run and jump several hexagons (each of them have their own rules). Walk and run are almost the same.

The best path could be a combination or each movement type. Here is an example of map http://megamek.info/sites/default/files/isometric_view.png

Do you know a good algorithm for this complex pathfinding or a way to combine A results for each movement type?*

Source Link
alexvisio
alexvisio
  • 123
  • 5

Pathfinding with different movements types

I'm developing a bot for a BattleTech board game simulator http://en.wikipedia.org/wiki/BattleTech, is turn based.

Board is divided in hexagons, each one have a different terrain type and elevation. You drive a robot wich moves over them to destroy other robots.

I only know Dijkstra and A* pathfinding algorithms, but the problem is that there are 3 types of movements: walk, run and jump several hexagons (each of them have their own rules). Walk and run are almost the same.

The best path could be a combination or each movement type. Here is an example of map http://megamek.info/sites/default/files/isometric_view.png

And my question: Do you know a good algorithm for this complex pathfinding or a way to combine A* results for each movement type?