How to Find Path to a Certain Object Without Knowing Its Position in a Grid Based Video Game?
I´m in the middle of the development of a personal project . In this video game there is a grid based movement , creation and pathfinding system . Previously , I have used A* pathfinding in order to make certain characters move towards a certain known position .
But now I have encountereda big question . There is a character in my game that has to go to a certain kind of object , but this character doesn´t know the exact coordinate of such object . The easiest way of doing this would be to actually know the coordinates of those objects , calculate which one is the nearest one and use A* pathfinding in order to get to that point , but that aproach seems really rigged and not dynamic enough for the type of game I´m making.
So I would like to know if there is some pathfinding algorithm that searches around a certain point (the location of the character that is using that algorithm) , like in a radial way , and keeps searching until it finds the object type that is looking for and returns the path to that certain object.
Look up for Dijkstra's Algorithm. It basically covers the whole graph before calculating the shortest path to a destination, unlike A* which goes towards the destination upfront. In other words, Dijkstra finds ALL the paths to All Nodes from a source, but then choose a destination and its shortest path or least cost. There is a nice GIF on Wiki illustrates what I mean here: Click and look up A* on Wiki to see its GIF and understand this comparison.
How Dijkstra's Algorithm approach the shortest path to a destination:
How A* Algorithm approach the shortest path to a destination:
- Simple frame by frame video decoder library
- GCC no longer implements <varargs.h>
- Contents of IO buffer unknown == unsafe?
- Avoiding strcpy overflow destination warning
- Sort program not working, not sure why
- Fast & accurate atan/arctan approximation algorithm
- What's the difference between strtok_r and strtok_s in C?
- How memory address for pointer to arrays is same as an element in 2D array?
- Which is the best way to suppress "unused variable" warning
- How to use ellipsis in c's case statement?
- How can I exclude non-numeric keys? CS50 Caesar Pset2
- Fast ceiling of an integer division in C / C++
- Is there an invalid pthread_t id?
- How to Implement Universal Setter/Getter Functions for Interrupt-Driven Variables in Embedded C?
- How does SIMD (avx) processing work? for example, if I want 10 32 bit floats how do i fit in a 256 bit avx vector?
- FDCAN problems on STM32G4
- How does the call macro enable mutual recursion between functions f and g in this Hanoi Tower implementation?
- Running test on Rocket core CPU - global variable initialized to 0 is unsuccessful, output wrong value instead
- Interacting with C arrays without knowing the size
- Combination of two strings
- carriage return by fgets
- How to use special characters in C?
- Why does 1.0/100.0 == 0.1/10.0 give True?
- Is it correct to compare pointers in C?
- Force free() to return malloc memory back to OS
- How can I print to standard error in C with 'printf'?
- What is the standard behavior of fread in C on Windows?
- How is strtok removing lines it shouldn't have access to?
- Using array as smart point in C
- Assigning string to malloced 2d char array not working as intended