This paper presents the application of artificial intelligence search strategies for solving assembly sequence planning problems. Research issues such as representation and evaluation of assembly sequences are addressed. Based on an assumption that the sequence of assembly is the reverse of that of disassembly, this study uses tree representation for the feasible assembly sequence plans. Both heuristic functions and search algorithms are developed using unidirectional and bidirectional search strategies for finding the final assembly sequence plan. Two assembly examples are presented for illustration.