These are some quick notes listing papers related to A* itself and variants. In particular, here I’m interested in papers that update \(h\) during the A* search, as a background for pruning. Specifically, our version of pruning increases \(h\) during a single A* search, and in fact the heuristic becomes in-admissible after pruning. Changing \(h\) The original A* paper has a proof of optimality. Later papers consider this also with heuristics that change their value over time.
