Review and Commentary: "Which Search Problems Are Random?"

Personal Study Project
by Charlton D. Rose

This is a discussion of "Which Search Problems Are Random," by Tad Hogg, published in the Proceedings of the Fifteenth National Conference on Artificial Intelligence (American Association for Artificial Intelligence).

1. Search Problems

  • What are search problems?
  • What does it mean to be intractable?

2. Approximate Entropy

  • What is a search ensemble?
  • What is approximate entropy?

3. Commentary

  • Why is ApEn useful?
  • How important are good problem representations?