摘要
寇克曼 (kirkman)于 1 847年提出了著名的“1 5个女生问题” ,本文提出一种解该问题的基于随机搜索和回溯的计算机算法。该算法已在微型机上实现 ,计算结果表明算法是有效的。在任意给定第 1天的安排后 ,该算法均能找出其它 6天满足要求的
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.
出处
《安徽电力职工大学学报》
2004年第1期94-95,共2页
Journal of Anhui Electric Power College for Staff