Why doesn't A* give the optimal path for navigating from A to R in this state space?
For A* to be optimal, the heuristic needs to be admissible (and this example shows why). This heuristic is not admissible because the heuristic value at M is 40, while the shortest path from M to R has length 30.