From what I understand:
Add the current node to the private list.
Find neighboring nodes in the current node, and if they are not invulnerable nodes, not a closed list, add that node to the open list with the parent being the current node, and calculate F, G and H. If the node already exists in the open list, check if going to this node through the current node will result in a lower G value - if so, make the parent node of this node the current node.
Find the node in the open list with the highest F value and make the current node which node.
Repeat until you reach the destination, then go to the parents of the node destination and you will return to the beginning of the node. This will be the best way.
So it makes sense for my brain, but when I actually try to do it on a chart, I think I don’t get it right.
(From the picture below) Go down from the green tile, which has an F value of 60. This is in the open list and has a lower F value than the lower right 74. Why is 74 selected instead of 60?

source share