AI - Heuristic search and / or tree

Wish tree

Wish tree refers to the search process is most likely to be the optimal solution tree tree. And / or heuristic tree search process is to continue to choose, hope the amendment process tree, in the process, hoping it is constantly changing. It needs to meet the following three conditions:

1. S0 desired initial node tree T
2. If n is a child node n1, n2, ..., nk, or node, the child node n is a necessary and sufficient condition ni desired tree T is
   
3. If n is a node, the node n of all the sub-tree T are desired.

---

Heuristic search process

---

Examples of heuristic search