• Announcements

    • khawk

      Download the Game Design and Indie Game Marketing Freebook   07/19/17

      GameDev.net and CRC Press have teamed up to bring a free ebook of content curated from top titles published by CRC Press. The freebook, Practices of Game Design & Indie Game Marketing, includes chapters from The Art of Game Design: A Book of Lenses, A Practical Guide to Indie Game Marketing, and An Architectural Approach to Level Design. The GameDev.net FreeBook is relevant to game designers, developers, and those interested in learning more about the challenges in game development. We know game development can be a tough discipline and business, so we picked several chapters from CRC Press titles that we thought would be of interest to you, the GameDev.net audience, in your journey to design, develop, and market your next game. The free ebook is available through CRC Press by clicking here. The Curated Books The Art of Game Design: A Book of Lenses, Second Edition, by Jesse Schell Presents 100+ sets of questions, or different lenses, for viewing a game’s design, encompassing diverse fields such as psychology, architecture, music, film, software engineering, theme park design, mathematics, anthropology, and more. Written by one of the world's top game designers, this book describes the deepest and most fundamental principles of game design, demonstrating how tactics used in board, card, and athletic games also work in video games. It provides practical instruction on creating world-class games that will be played again and again. View it here. A Practical Guide to Indie Game Marketing, by Joel Dreskin Marketing is an essential but too frequently overlooked or minimized component of the release plan for indie games. A Practical Guide to Indie Game Marketing provides you with the tools needed to build visibility and sell your indie games. With special focus on those developers with small budgets and limited staff and resources, this book is packed with tangible recommendations and techniques that you can put to use immediately. As a seasoned professional of the indie game arena, author Joel Dreskin gives you insight into practical, real-world experiences of marketing numerous successful games and also provides stories of the failures. View it here. An Architectural Approach to Level Design This is one of the first books to integrate architectural and spatial design theory with the field of level design. The book presents architectural techniques and theories for level designers to use in their own work. It connects architecture and level design in different ways that address the practical elements of how designers construct space and the experiential elements of how and why humans interact with this space. Throughout the text, readers learn skills for spatial layout, evoking emotion through gamespaces, and creating better levels through architectural theory. View it here. Learn more and download the ebook by clicking here. Did you know? GameDev.net and CRC Press also recently teamed up to bring GDNet+ Members up to a 20% discount on all CRC Press books. Learn more about this and other benefits here.
Sign in to follow this  
Followers 0
Dragonsoulj

Pathfinding in a TBS

6 posts in this topic

So I've been trying to plan out a turn-based strategy game, and was thinking about unit movement, with suggestion options to a player and to handle a computer player's choices. I was thinking of using a simple A* method to find the shortest route to the desired space. Since a space can be advantageous or problematic, would just adding an extra variable to the heuristic help in avoiding certain regions and moving towards others? For example, assuming a unit can move say 10 spaces a turn, and units could potentially be hiding in specific terrain, a unit would want to walk around the terrain a unit can hide in (like woods), so they don't run into a dangerous space. Would just rating the movement cost higher for that space be enough?

0

Share this post


Link to post
Share on other sites

Probably, although they would rarely take a shortcut through such terrain then, choosing to take the long way around. If the target space is in the terrain, they will probably search a much larger number of spaces before they find the correct route as well. Maybe you want to adjust the terrain cost based on how many dangerous units are available to the opponent that can use the cover?

0

Share this post


Link to post
Share on other sites

The current idea is I have a map that has a few terrain elements units can hide in during FoW. I'm trying to come up with a way to traverse around those spaces, instead of walking through them (walking through could trigger either a surprise attack or a full halt of the unit that is moving). Enemy unit count and units able to hide in that terrain is not known.

0

Share this post


Link to post
Share on other sites

Well yeah, just give the terrain a high movement cost then, they will avoid it then if there is a less expensive route available.

 

If the goal space is inside that terrain though you probably want to reduce the movement cost penalty for the terrain of that type which is connected to the goal?

1

Share this post


Link to post
Share on other sites

I think a function that creates a "terrain evaluation" would work for adding an additional value to the movement cost. Keep the terrain danger value but add in a negative due to it being a goal space.

 

Thanks for the advice. I'll have to see how things pan out as I go.

0

Share this post


Link to post
Share on other sites

Don't reduce the value of all the terrain that is the same type as the goal though... either the terrain of the same type that is connected to the goal (floodfill), or maybe based on the distance from the goal as well, so you try to path through as little terrain of that type as possible to reach the goal.

 

Reducing just the goal space and no others is useless since if there is a finite cost the A* algorithm will find the path to the goal; it will just search more and more nodes trying to find it. You probably want to give a negligible cost to all spaces right next to the goal though so if you are right next to it in your search you go that way first.

1

Share this post


Link to post
Share on other sites

Reducing just the goal space and no others is useless since if there is a finite cost the A* algorithm will find the path to the goal; it will just search more and more nodes trying to find it. You probably want to give a negligible cost to all spaces right next to the goal though so if you are right next to it in your search you go that way first.

 

That's a good point. I guess I wasn't thinking that part through all the way. rolleyes.gif That's why we plan things out, right?

0

Share this post


Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!


Register a new account

Sign in

Already have an account? Sign in here.


Sign In Now
Sign in to follow this  
Followers 0