Hi, it seems to me that, in the TP1, the "h" function of the Q3 is not admissible because it overestimates the remaining distance from B to G2. The A* algorithm can't find the shortest path "('SBEG2', 13)". Instead it converges towards "('SACDG1', 14)".

Best regards,
Loup