August 5 Come on, chicken dishes

Today saw a lot, play a lot of words, today saw the top five in the search, depth-first, breadth-first, priority queues to optimize the breadth-first search, priority queues to optimize the depth-first search, different weights deque search. DFS BFS is something bad street, this stuff is simply bad science Damn, this is the basis of the algorithm graph theory, bad science search means giving up most of graph theory, widely found to be quite satisfactory sequentially layer by layer recursive search, the search is depth-first search down by a branch not hit a brick wall did not give up, compared to the priority queue optimization of search terms, always choose the minimum price, but the future does not mean that the current minimum minimum, when the search results in the lower branch of the current maximum price, it will last traverse, this time to be spent than the average time spent searching even more, but the average time spent searching is also very impressive, so have a * algorithm, a * algorithm but could not understand his f (x) valuation function, so wait, tomorrow, the main task is to make it clear what the search algorithm calculation problem with what and how needs pruning.