 In this approach, all alternative moves at a node are searched, and none are pruned away.They discovered that the time required to simply search all the moves was much less than the time required to apply knowledge-intensive heuristics to select just a few of them, and the benefit of not prematurely or inadvertently pruning away good moves resulted in substantially stronger performance.The developers of a chess-playing computer system must decide on a number of fundamental implementation issues.