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

摘要： 棋盘多项式的生成算法有多种，都采用了递归的思想。递归算法效率较低，针对此问题，提出一种棋盘多项式非递归生成算法，并用Visual C++实现，给出了在禁位排列中的应用实例。算法分析及程序运行结果表明该算法在速度上优于现有的生成算法，并能同时给出具体排列方案，具有实用价值。

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