Abstract: The game playing is an important domain of heuristic search，and its procedure is represented by a special and/or tree.Alpha-beta pruning is always used for problem solving by searching the game-playing-tree.In this paper，the plan which child nodes are inserted into game-playing-tree from large value of estimation function to small one when the node of no receiving fixed ply depth is expanded is proposed based on alpha-beta pruning.It improves the effect of search.