static void Main(string[] args)
{
var badnessFactor = 3;
var teams = new[]
{
new Team(0, 3, 1, 0, 0, 0),
new Team(1, 2, 0, 1, 0, 0),
new Team(2, 1, 0, 0, 1, 0),
new Team(3, 0, 0, 0, 0, 1),
new Team(4, 3, 0, 0, 0, 1),
new Team(5, 2, 0, 0, 1, 0),
new Team(6, 1, 0, 1, 0, 0),
new Team(7, 0, 1, 0, 0, 0)
};
Array.Sort(teams, (x, y) => y.Score.CompareTo(x.Score)); //High to low
var rooms = teams.Length / 4;
//Positions[room * position] = TeamId
var positions = new List <VariableInteger>(teams.Length);
for (var i = 0; i < teams.Length; i++)
{
positions.Add(new VariableInteger($"Team_{i}", 0, teams.Length - 1));
}
//Scores[teamId] = current score
var scores = new ConstrainedArray(teams.Select(x => x.Score));
//Optimise positions
var firstProp = new ConstrainedArray(teams.Select(x => x.FirstProp * badnessFactor));
var secondProp = new ConstrainedArray(teams.Select(x => x.SecondProp * badnessFactor));
var firstOpp = new ConstrainedArray(teams.Select(x => x.FirstOpp * badnessFactor));
var secondOpp = new ConstrainedArray(teams.Select(x => x.SecondOpp * badnessFactor));
var maxBadness = firstProp.Union(secondProp).Union(firstOpp).Union(secondOpp).Max() * teams.Length;
var optimise = new VariableInteger("optimise", 0, maxBadness);
//TODO Change optimise to look at the bound and stop if best reached
var variables = new List <VariableInteger>(positions);
variables.Add(optimise);
var constraints = new List <IConstraint> {
new AllDifferentInteger(positions)
};
for (var i = 0; i < rooms - 1; i++)
{
for (var j = 0; j < 4; j++)
{
var x = positions[i * 4 + j];
for (var k = 0; k < 4; k++)
{
var y = positions[(i + 1) * 4 + k];
constraints.Add(new ConstraintInteger(scores[x] >= scores[y]));
}
}
}
constraints.Add(new ConstraintInteger(optimise == maxBadness -
firstProp[positions[0]] - firstOpp[positions[1]] - secondProp[positions[2]] - secondOpp[positions[3]]
));
IState <int> state = new StateInteger(variables, constraints);
StateOperationResult searchResult;
IDictionary <string, IVariable <int> > solution;
state.StartSearch(out searchResult, optimise, out solution, 2);
if (searchResult == StateOperationResult.Unsatisfiable)
{
Console.WriteLine("Could not find a solution");
Console.ReadKey();
return;
}
if (searchResult == StateOperationResult.TimedOut)
{
Console.WriteLine("Search timed out before a solution could be found");
Console.ReadKey();
return;
}
Console.WriteLine("Runtime:\t{0}\nBacktracks:\t{1}\nSolutions:\t{2}", state.Runtime, state.Backtracks, state.NumberOfSolutions);
Console.WriteLine("Badness:\t{0}", solution[optimise.Name].InstantiatedValue);
Console.WriteLine("Room | 1P | 1O | 2P | 2O | Scores ");
for (var i = 0; i < rooms; i++)
{
var fp = solution[positions[i * 4].Name].InstantiatedValue;
var sp = solution[positions[i * 4 + 1].Name].InstantiatedValue;
var fo = solution[positions[i * 4 + 2].Name].InstantiatedValue;
var so = solution[positions[i * 4 + 3].Name].InstantiatedValue;
Console.WriteLine("{0,-5}|{1,3} |{2,3} |{3,3} |{4,3} | {5} {6} {7} {8}", i, fp, sp, fo, so, scores[fp], scores[sp], scores[fo], scores[so]);
}
Console.ReadKey();
}
