Proposal #35: Constraint-resolved Matchbox.

I propose that IC Matchbox will be subsituted by a IT system based on Constraints Solver. CISV International shoud hire a IT Consultant to design such system in order to create an easy interface to inster "constrains" to the system which willbe than perfomed by IO, based on NA requests. Such system should be flexible enough to be used for the creation of pools of all programms.

Rationale

The primary aim of such a proposal is to get rid of the IC Matchbox, which actually is a very confusing and exclusive procedure (for countries which cannot attend). Expaning this idea I believe that such system will be very much usefull for other program too, freeing some IO officier time, to be dedicated to some more interesting

Background

Accoding to wikipedia (http://en.wikipedia.org/wiki/Constraint_satisfaction) in computer science, constraint satisfaction is the process finding a solution to a set of constraints. Such constraints express allowed values for variables, and a solution is therefore an evaluation of these variable that satisfies all constraints. Constrains could be easily express criterias for camp pool creations (such as all delegation of each camp should be different, at least 2 delegation from the same region shoul be present... etc) or criterias to match IC partner (NA willing to have N interchange in july with a certain region... etc).

Respectfully submitted, Teo (ITA)

{The interchange Matchbox is held during the Annual International Meeting (AIM) on one particular evening, where all NAs can participate to finalize who does an interchange with whom according to specific needs and wishes.}