Updated readme with the deep logic

Author: pablogsal

README.md

@@ -184,3 +184,13 @@ class DijkstraHeap(list):
         self.costs[next_elem.point] = next_elem.cost
         return next_elem
 ```
+
+# So WHAT is this deep logic you talk about?
+
+I think the deep logic about A* can be sumarized in the following two simple points:
+
+* We visit the nodes in order, being this order the cost of going from the starting point to this particular node.
+
+* We artificially alter the cost of visiting one node taking into account how far this particular node is from the destination, making the furthest nodes more costly.
+
+And all the stuff about the cost queue, the heap, not visiting a node already visited, what we do with nodes in the queue that have been visited.....that is important stuff but ** is NOT the A* algorithm ** : it is secondary logic and secondary problems that lead to secondary data structures.