A table of precomputed exact abstract goal distances used as an abstraction heuristic. Retaining a subset of the disks of a Tower of Hanoi instance gives a smaller abstract puzzle: moving an ignored disk does not change the abstract state, and moving a retained disk projects to a legal abstract move. Taking maxima of pattern database estimates preserves admissibility; summing them requires an additional cost-partition argument.

Ancestors (8)

  1. Abstraction heuristic
  2. Relaxation heuristic
  3. Search problem
  4. Computational problem
  5. Computational complexity theory
  6. Theoretical computer science
  7. Computer science
  8. Home

Incoming links (3)

View article source

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version