6.3. The Discussion of Statistical Heuristic Search
6.3.1. Statistical Heuristic Search and Quotient Space Theory
The heuristic search generally implements on a tree. A tree is a specific case of a sequence of quotient spaces. If in a sequence of hierarchical quotient spaces, the number of elements in each level is finite, then it’s a tree. Assume that SA implements its search on a uniform m-tree. Let 
be the sub-nodes in the first level. From quotient space point of view, it is equivalent to the partition 
of domain , where is a set of leaf nodes ...
be the sub-nodes in the first level. From quotient space point of view, it is equivalent to the partition of domain , where is a set of leaf nodes ...Get Quotient Space Based Problem Solving now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
