Hello, I need to calculate the shortest path between two points with the ability to circumvent obstacles.
Description tasks:
PLAYING field is a 10x10 matrix (a unit of measurement - Cell)
The player is in a 5x5 cell. It needs to be moved to a cell 8x9, but in different locations facing objects that are preventing it from doing so directly. There must be an algorithm that helps to calculate the path of bypass obstacles.
crioto
0
Newbie Poster
Recommended Answers
Jump to PostLook for any information you can find about the A-star graph-search algorithm. It's a heuristic-based best-first search -- it is pretty much the de-facto 2D pathfinding algorithm, and it works well in tile-based maps. This is probably the best introduction to A-star, specifically for tile maps: http://www.policyalmanac.org/games/aStarTutorial.htm
…
All 4 Replies
MattEvans
473
Veteran Poster
Team Colleague
Featured Poster
crioto
0
Newbie Poster
Phaelax
52
Practically a Posting Shark
MattEvans
473
Veteran Poster
Team Colleague
Featured Poster
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.