A* concept

[Joseph]

if you are confused feel free to ask question

 

i was writing down notes while watching an A* algor

Open list =  checking nodes
close list = checked nodes (checked node, current node)

get current node
add all adjacent to open list

H, G , F: <---- COST
(F = G + H)

[MOVING COST (rethink this)
diagnal = 14G
straight = 10G
] 

F gets added into the closed list. (F < #)
G = movement cost (distance from current node, to the adjacent node).
H = distance from target node 

calculate the H, G, F cost,
and give it a parent node (prev node)

then look for an adjacent nodes again,
add none repeatting nodes to open list.

compare: (youtube)
     if (parent g + current G < parent new G) { 
        add new node to closed list, new block parent = prev block parent
     }

(my idea):
Grand parent, parent, son

if (grand parent already has son in open list before the parent was looking)	{
     calculation the distance.
if (son has the less g cost then, the grand parent and parent g cost together)	{
     add son to closed list, add grand parent as the new parent
     try to remove the initial parent. (you could keep)
}}

stop algor once target node is in the closed list
retrace steps and use the prev node and add it into a list. 
reverse it to have a normal path

[eggsftw1]

what is this even used for? making scripts?

[AresScripts]

what is this even used for? making scripts?

Its used for pathfinding. It finds the shortest path around unwalkable areas(like walls or trees)

[eggsftw1]

Its used for pathfinding. It finds the shortest path around unwalkable areas(like walls or trees)

 

ahh gotcha im not very good with that sort of stuff i guess you could say im your target audience

[AresScripts]

ahh gotcha im not very good with that sort of stuff i guess you could say im your target audience

no problem

[Botre]

Don't use the list data structure for the sets.

You should use PriorityQueue or another heap-type ds for the open set & something like a HashSet for the closed set.