Algorithm for Knowledge Activation 1. Given P(the Initial State of the Problem), E(the Knowledge and the rule bases)and g(the Final state of the problem) 2. Select the best rule. from the rule base so that whose left side matches the Initial State while whose right side leads to such a new state whose distance to the goal is the minimum compared with other selections by using the Knowledge 3. Check the new state thus obtained. If its distance to the Goal is the smallest one but unequal to zero do the same thing from the New State as did in step 2 4, Otherwise, re-select a rule at step 2 5. Until the distance between the new state and the goal equal to zero, or sufficiently small, go loop from step 2 to 4. The sequence of the rule applications is the strategy sought.Algorithm for Knowledge Activation 1. Given P(the Initial State of the Problem), E(the Knowledge and the Rule Bases) and G(the Final State of the Problem) 2, Select the best Rule, from the Rule Base, so that whose left side matches the Initial State while whose right side leads to such a New State whose distance to the Goal is the minimum compared with other selections by using the Knowledge 3, Check the New State thus obtained. If its distance to the Goal is the smallest one but unequal to zero, do the same thing from the New State as did in step 2 4, Otherwise, re-select a rule at step 2 5, Until the distance between the New State and the Goal equal to zero, or sufficiently small, go loop from step 2 to 4. The sequence of the rule applications is the strategy sought