Abstract: This paper presents an artificial intelligence graph search production system for maze routing problem. Using different coatrol strategies, Lee(IRE Trans. EC-10, 1961: 346-365) and Rubin's (IEEE Trans. C-23, 1974: 907-914) algorithm can be realized on the system. Considering the defects of Lee and Rubin's algorithms, a novel heuristic procedure for the same problem is proposed. The number of cells for procedure searches is decreased about 30% than that of Rubi n's algorithm done. Finally, in a statistical analysis of Lee and Rubin's algorithms and the procedure proposed are provided.