Same as Manhattan but the distance is weighted by 3. This technique is faster but gives a less precise result in number of strokes as:
d(A,B) = 3 * (|XA - XB| + |YA - YB|)
Theses graphics show all the data mixed with all algorithm. In the center of the graph you got the current data and all around the value with each algorithm
Time: the time of each algorithm
Strokes: the number of strokes
Branch depth: the average of all branch depth
Time Complexity: total number of states ever selected in the "opened" set
Memory Complexity: maximum number of states ever represented in memory at the same timeduring the search
Complexity: Time * Strokes