{'fraction_non_alphanumeric': 0.014605647517039922, 'fraction_numerical': 0.0, 'mean_word_length': 5.718954248366013, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Search Methods Using Heuristic Strategies

Real-valued heuristic functions have been extensively used as a means for constraining search in large problem spaces. In this paper we look at an alternative approach, called strategic search, In which heuristic information is expressed as strategies. Strategic search generates a search graph by following some strategy or set of strategies, backtracking to previous choice points when the current strategy falls. We first examine algorithms for performing strategic search using both deterministic and nondeterministic strategies. Some examples are given which indicate that strategic search can outperform standard heuristic search methods. The construction of strategies is also considered, and reans for acquiring strategic information both from analagous problems and from example execution traces are described. Finally, we indicate how meta-level strategies can be used to guide the application of object level strategies, thus providing a hierarchy of strategic information.