| 一种解寇克曼问题的计算机算法 |
| |
| 引用本文： | 程锦松. 一种解寇克曼问题的计算机算法[J]. 安徽电气工程职业技术学院学报, 2004, 9(1): 94-95 |
| |
| 作者姓名： | 程锦松 |
| |
| 作者单位： | 安徽大学计算机系,安徽,合肥,230039 |
| |
| 摘 要： | 寇克曼 (kirkman)于 1 847年提出了著名的“1 5个女生问题” ,本文提出一种解该问题的基于随机搜索和回溯的计算机算法。该算法已在微型机上实现 ,计算结果表明算法是有效的。在任意给定第 1天的安排后 ,该算法均能找出其它 6天满足要求的 3人组安排
|
| 关 键 词： | 寇克曼问题 随机搜索 回溯 |
| 文章编号： | 1009-1238(2004)01-0094-02 |
| 修稿时间： | 2003-01-21 |
A Computer Algorithm for Solving Kirkman Problem |
| |
| Cheng Jin-song. A Computer Algorithm for Solving Kirkman Problem[J]. Journal of Anhui Electrical Engineering Professional Technique College, 2004, 9(1): 94-95 |
| |
| Authors: | Cheng Jin-song |
| |
| Abstract: | Kirkman presented famous ″fifteen schoolgirls problem″ in 1847. In this paper, a computer algorithm for solving Kirkman problem is presented. The algorithm is based on random search and backtracking. The practical computation show the algorithm is effect. After presented the 1st day arrangement, the algorithm will find out other 6 days′ 3-persons group arrangement which contents to the requirement. |
| |
| Keywords: | Kirkman problem random search backtracking |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
