Hi Pd friends,
I have the following problem:
I am part of an Installation for 200 people. I need to calculate the audiance flow. The installation has 19 places/stages where a different amount of people will fit in (from 1 to 25). And there are 10 time slots. Now i want to hand every person a card which place at what time they have to visit. There are different atributes each stage has. Some stages can be visited only once, some can be visited twice, but not at timeslots 1 + 2 but 1 + 4 for example. And some other atributes, like you should not be together in a stage with the same audiance member twice (this is a very weak attribute - meaning it is not too bad if it has to happen).
How can this be calculated? I have the feeling it is finally time to learn data structures for me!
I was thinking every person get a structure of a template [struct audiance float person nr array time-slots slot] and than the the rooms need to be an abstraction of some kind, which can have different arguments. and than there needs to be a recursive method to distribute the audiance. Somehow i had to think of the autoroot funktion in Eagle to find pathes for electrical wires on a circuit board. Is the challange understandable? What do you think?