限界剪枝法语回溯法类似，是一种在问题的状态空间树中搜索解的算法。优先级用优先队列来实现，优先级高即估计函数值越低的结点越靠近队列开头位置。-French back-Bound pruning method similar to the problem is a state-space search tree algorithm solution. Priority queue with priority to the realization of the high priority that is, the lower the value of the estimated function of the node at the beginning of the more close to the location of the queue.