Controlled search over finite permutation groups
Mario Aranha · ThinkTech (Texas Tech University) · 1984
A penetrance learning system is implemented to mechanically find a heuristic to perform a heuristically controlled search over finite permutation group graphs. The learning system is based on probabilistic analysis. A sample solution is evaluated in detail. Seasonably good results were obtained.