Randomising with adjacency constraints

82 Views Asked by At

I am a high school political science teacher looking for some help in implementing a classroom exercise. It's a puzzle of sorts, I suppose. I've tried Googling the issue for a while, but my GoogleFu is simply not good enough to get me the solution I need. I apologise if I'm unclear in my description below.

I want my class of 9 students to create a chain of arguments that respond to the previous one in the chain. I would like each student to be working in parallel, so there will be 9 chains being built simultaneously. I visualise it as a 9x9 table, with the columns being the themes of the argument chains and the rows being the responses.

I would like to generate an order in which my students will be responding to arguments such that:

1) Each student is represented only once in each 'row' (responses).

2) Each student is represented only once in each 'column' (chain).

3) No student responds to the same student more than once, that is, in the vertical order of the columns, student X does not succeed Y in more than one column.

I'm happy to be directed elsewhere if my question is not appropriate. Thanks for your help!

1

There are 1 best solutions below

5
On BEST ANSWER

Yes you can! Here's how:

I found this example in Some New Row Complete Latin Squares by D.S Archdeacon, J.HDinitz and D.RStinson, see http://www.sciencedirect.com/science/article/pii/0097316580900400