On Thu, 23 Aug 2018 at 15:32, Sibylle Koczian wrote:
>
> Am 21.08.2018 um 23:36 schrieb Poul Riis:
> > I would like to list all possible ways to put N students in groups of k
> > students (suppose that k divides N) with the restriction that no two
> > students should ever meet each other in more
Am 21.08.2018 um 23:36 schrieb Poul Riis:
I would like to list all possible ways to put N students in groups of k
students (suppose that k divides N) with the restriction that no two students
should ever meet each other in more than one group.
I think this is a classical problem and I think the
I find it surprisingly difficult to find information on this issue on the
internet. Until now I've only found this preview of an article:
https://www.jstor.org/stable/3615434?seq=1#page_scan_tab_contents
Still, I can hardly believe that nobody has made some efforts to make a python
algorithm to
On Wed, 22 Aug 2018 at 17:33, Richard Damon wrote:
> Paul, my understanding of the problem is that you want to create multiple
> divisions of the larger group into smaller groups, such that if two people
> are in the same group in 1 division, they never appear together in other
> divisions.
>
>
> On Aug 22, 2018, at 8:51 AM, Paul Moore wrote:
>
>> On Wed, 22 Aug 2018 at 00:44, Poul Riis wrote:
>>
>> I would like to list all possible ways to put N students in groups of k
>> students (suppose that k divides N) with the restriction that no two
>> students should ever meet each other i
On Wed, 22 Aug 2018 at 00:44, Poul Riis wrote:
>
> I would like to list all possible ways to put N students in groups of k
> students (suppose that k divides N) with the restriction that no two students
> should ever meet each other in more than one group.
> I think this is a classical problem a
On Tue, 21 Aug 2018 14:36:30 -0700, Poul Riis wrote:
> I would like to list all possible ways to put N students in groups of k
> students (suppose that k divides N) with the restriction that no two
> students should ever meet each other in more than one group. I think
> this is a classical problem
I would like to list all possible ways to put N students in groups of k
students (suppose that k divides N) with the restriction that no two students
should ever meet each other in more than one group.
I think this is a classical problem and I think there must be a python solution
out there but
