八皇后问题的三种方案及其程序设计  

Three projects and their program designs of eight queens chess problem

作　　者：彭学君[1] 

机构地区：[1]衡水师专计算机中心,河北衡水053000

出　　处：《德州学院学报》2002年第4期51-54,共4页Journal of Dezhou University

摘　　要：八皇后问题是各类语言程序设计中的较著名的题目 .关于八皇后问题的编程解多种多样 ,涉及BASIC、C、PASCAL等 ,但多是就事论事 ,缺少相应的比较、分析、综合 .文中以非递归算法、递归算法。Eight queens chess problem is a famous theme in all kinds program design langue. There are many program explains in BASIC,C and PASCAL langue. But they consider it as its stands and are lack of compare, analysis and integration. In this paper, there are some discussions about eight queens with no-recursive algorithm, recursive algorithm and dynamic graphics implement algorithm. In the meaning time, there are their program designs about them, too.

关 键 词：八皇后问题 递归算法 程序设计 

分 类 号：TP311.11[自动化与计算机技术—计算机软件与理论]