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.
递归算法效率较低,针对此问题,提出一种棋盘多项式非递归生成算法,并用Visual C++实现,给出了在禁位排列中的应用实例。
Last,we put this method into the use of forbidden ranking.
讲述棋阵多项式计算原理,给出四种方法并比较它们的优缺点和适用情况,最后给出了最优方法的算法设计和程序实现,并且通过禁位排列显示该方法在现实中的应用。