The solution to a particular problem will correspond to a path in the state space graph - the shortest optimal solution

If you can't go any further, turn around.

Divide a problem into several steps for operation

Distance traveled, cost consumed, time elapsed

Given n points, pass each point exactly once

Each time the search method makes a choice, select the leftmost (right) branch. If there is no branch, backtrack to find the parent node.

From left to right, visit nodes layer by layer

Set the search depth in advance. If this value is exceeded, branch search will be performed.

Rules of thumb for problem solving

Using the maximization (minimization) measure, there is no way to tell whether you are on the correct path. Close to goal state but unable to reach it

Know how to approach a goal state, be able to make decisions in a given state, and make the best decision from multiple options

To reach the target node, make a decision on which node and how many nodes to explore

In order to find the optimal path, partial paths will continue to be generated until the cost of each path is greater than or equal to the found path cost.

F=G H G: Cost to reach the current node H: Estimated cost from the current node to the target node

h must be less than or equal to the actual minimum cost h from the current node to the target node. F must maintain monotonically increasing

Theory of evolution, simulating the evolutionary process to randomly search for optimal solutions

Consensus initiative that simulates insect colonies to solve difficult combinatorial problems and perform useful data clustering procedures

Principles of solid annealing in physics

Birds hunt for food, and individuals share information to move the entire group, resulting in an evolutionary process from disorder to order in the problem-solving space.

Social customs, solving scheduling problems