Search could be used to find perfect sequence of moves except the following problems arise:
chess has nodes in search space
With single-agent search (15 puzzle), can afford to wait
Some 2-player games have time limits
Solution? Search to n levels in the tree (n ``ply''), evaluate the nodes at the nth level, and head for the best looking node