关键词: 棋盘多项式, 非递归, 算法, 禁位排列

Abstract: There have been many creating algorithms of chessboard polynomial， which are all recursive. Though recursion is less efficient. Aiming at it， a kind of non-recursive algorithm on the chessboard polynomial is presented in the paper and is realized by Visual C++， then an example in forbidden ranking is given. According to algorithm analysis and running results of program， it can be concluded that the non-recursive algorithm is faster than those existed ones， and it also can generate the ranking scheme at the same time，which show its value of application.

Key words: chessboard polynomial, non-recursion, algorithm, forbidden ranking