I understand, now doing this allows for something to happen when clicking a buried tile, but the player is now offset by a tile, usually diagonally? Is it possible to have the player arrive at the same tile as clicked whilst also checking buried tiles? Whatever loop you want to choose will work (in exponential longer ticks). Now it checks just hor and vertical (4 tiles) in a simple loop. So, if you got a clickable tile buried deep down, and you want to check for every walkable tile arround it (dont matter how far away) if it can be reach and if it is the closest reachable, your search tree goes deep and exponential in amount of choices. The case is to find the shortest available walkable tile that can be reached. It is not a case of finding the shortest available walkable tile to the click position, that is pretty easy, you can do that on your own. In the end, when you dont limit the search tree (and that is ALWAYS true), you end up checking to many possibilitys. I did not like it at all in a example that i made.Īlso, it will be slower. That will also mean that they are taken into account when calculating/choosing the shortest path.
#A STAR AI SELECTS AN UNWALKABLE NODE TO WALK TO FREE#
They have no free spot on a vert or hor position.Ĭross the two 'loopindex(".") = 0' conditions in event 11 to have the diagonals available.
0 kommentar(er)
