[misc] seating in tournaments: a mathmatical approach.

After some confusion I could imagine and have seen in tournaments, and from my recent self-torture on taking a class in combinatorics, I have realized that seating for a tournament for VTES would make a good combinatorics problem... Has anyone found a mathmatical approach to seating multiples of 5 people onto a table consisting of 5 people, three different ways, such that, for all people, the person to the left and right of them is different each time, and that for any given person, they are seated at the same position, at most, once? Would be nice to have a consistant method of doing this (assuming one does not already exist). It would be nice to know if an answer doesn't already exist, so I can worry myself about more interesting combinatoric problems (like the ones I'm required to do for homework. :)) ~SV

[ quoted text not captured ] If there are 5+ tables, then yes, there is a straight-forward algorithm for producing a "perfect" seating arrangment that meets your stated goals and moreover makes it so that each pair of players never share a table more than once. For 1-4 tables, I know of no such algorithm. -- LSJ (vte...@white-wolf.com) V:TES Net.Rep for White Wolf, Inc. Links to revised rulebook, rulings, errata, and tournament rules: http://www.white-wolf.com/vtes/