ConstraintSolver 0.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- data/bin/ConstraintSolver +24 -0
- data/doc/classes/Array.html +209 -0
- data/doc/classes/ConstraintSolver.html +242 -0
- data/doc/classes/ConstraintSolver/AbstractConstraint.html +317 -0
- data/doc/classes/ConstraintSolver/AllDifferentConstraint.html +451 -0
- data/doc/classes/ConstraintSolver/AllDifferentConstraintTest.html +397 -0
- data/doc/classes/ConstraintSolver/BinaryConstraint.html +483 -0
- data/doc/classes/ConstraintSolver/BinaryConstraintTest.html +367 -0
- data/doc/classes/ConstraintSolver/BinaryRelation.html +276 -0
- data/doc/classes/ConstraintSolver/BinaryRelationTest.html +194 -0
- data/doc/classes/ConstraintSolver/ConstraintList.html +208 -0
- data/doc/classes/ConstraintSolver/ConstraintListTest.html +252 -0
- data/doc/classes/ConstraintSolver/ConstraintSolver.html +353 -0
- data/doc/classes/ConstraintSolver/ConstraintSolverTest.html +403 -0
- data/doc/classes/ConstraintSolver/Domain.html +522 -0
- data/doc/classes/ConstraintSolver/DomainTest.html +356 -0
- data/doc/classes/ConstraintSolver/DomainWipeoutException.html +158 -0
- data/doc/classes/ConstraintSolver/Problem.html +239 -0
- data/doc/classes/ConstraintSolver/ProblemTest.html +227 -0
- data/doc/classes/ConstraintSolver/Solution.html +342 -0
- data/doc/classes/ConstraintSolver/SolutionTest.html +250 -0
- data/doc/classes/ConstraintSolver/UndoStackEmptyException.html +158 -0
- data/doc/classes/ConstraintSolver/Variable.html +418 -0
- data/doc/classes/ConstraintSolver/VariableTest.html +284 -0
- data/doc/classes/ExtensionsTest.html +233 -0
- data/doc/classes/Fixnum.html +153 -0
- data/doc/created.rid +1 -0
- data/doc/dot/f_0.dot +38 -0
- data/doc/dot/f_0.png +0 -0
- data/doc/dot/f_1.dot +392 -0
- data/doc/dot/f_1.png +0 -0
- data/doc/dot/f_10.dot +392 -0
- data/doc/dot/f_10.png +0 -0
- data/doc/dot/f_11.dot +38 -0
- data/doc/dot/f_11.png +0 -0
- data/doc/dot/f_12.dot +392 -0
- data/doc/dot/f_12.png +0 -0
- data/doc/dot/f_13.dot +392 -0
- data/doc/dot/f_13.png +0 -0
- data/doc/dot/f_14.dot +392 -0
- data/doc/dot/f_14.png +0 -0
- data/doc/dot/f_15.dot +392 -0
- data/doc/dot/f_15.png +0 -0
- data/doc/dot/f_16.dot +392 -0
- data/doc/dot/f_16.png +0 -0
- data/doc/dot/f_17.dot +392 -0
- data/doc/dot/f_17.png +0 -0
- data/doc/dot/f_18.dot +392 -0
- data/doc/dot/f_18.png +0 -0
- data/doc/dot/f_19.dot +392 -0
- data/doc/dot/f_19.png +0 -0
- data/doc/dot/f_2.dot +392 -0
- data/doc/dot/f_2.png +0 -0
- data/doc/dot/f_3.dot +392 -0
- data/doc/dot/f_3.png +0 -0
- data/doc/dot/f_4.dot +392 -0
- data/doc/dot/f_4.png +0 -0
- data/doc/dot/f_5.dot +392 -0
- data/doc/dot/f_5.png +0 -0
- data/doc/dot/f_6.dot +14 -0
- data/doc/dot/f_6.png +0 -0
- data/doc/dot/f_7.dot +392 -0
- data/doc/dot/f_7.png +0 -0
- data/doc/dot/f_8.dot +392 -0
- data/doc/dot/f_8.png +0 -0
- data/doc/dot/f_9.dot +392 -0
- data/doc/dot/f_9.png +0 -0
- data/doc/dot/m_10_0.dot +392 -0
- data/doc/dot/m_10_0.png +0 -0
- data/doc/dot/m_12_0.dot +392 -0
- data/doc/dot/m_12_0.png +0 -0
- data/doc/dot/m_13_0.dot +392 -0
- data/doc/dot/m_13_0.png +0 -0
- data/doc/dot/m_14_0.dot +392 -0
- data/doc/dot/m_14_0.png +0 -0
- data/doc/dot/m_15_0.dot +392 -0
- data/doc/dot/m_15_0.png +0 -0
- data/doc/dot/m_16_0.dot +392 -0
- data/doc/dot/m_16_0.png +0 -0
- data/doc/dot/m_17_0.dot +392 -0
- data/doc/dot/m_17_0.png +0 -0
- data/doc/dot/m_18_0.dot +392 -0
- data/doc/dot/m_18_0.png +0 -0
- data/doc/dot/m_19_0.dot +392 -0
- data/doc/dot/m_19_0.png +0 -0
- data/doc/dot/m_1_0.dot +392 -0
- data/doc/dot/m_1_0.png +0 -0
- data/doc/dot/m_2_0.dot +392 -0
- data/doc/dot/m_2_0.png +0 -0
- data/doc/dot/m_3_0.dot +392 -0
- data/doc/dot/m_3_0.png +0 -0
- data/doc/dot/m_4_0.dot +392 -0
- data/doc/dot/m_4_0.png +0 -0
- data/doc/dot/m_5_0.dot +392 -0
- data/doc/dot/m_5_0.png +0 -0
- data/doc/dot/m_7_0.dot +392 -0
- data/doc/dot/m_7_0.png +0 -0
- data/doc/dot/m_8_0.dot +392 -0
- data/doc/dot/m_8_0.png +0 -0
- data/doc/dot/m_9_0.dot +392 -0
- data/doc/dot/m_9_0.png +0 -0
- data/doc/files/lib/AbstractConstraint_rb.html +148 -0
- data/doc/files/lib/AllDifferentConstraint_rb.html +156 -0
- data/doc/files/lib/BinaryConstraint_rb.html +155 -0
- data/doc/files/lib/ConstraintList_rb.html +148 -0
- data/doc/files/lib/ConstraintSolver_rb.html +162 -0
- data/doc/files/lib/Domain_rb.html +155 -0
- data/doc/files/lib/Problem_rb.html +148 -0
- data/doc/files/lib/Solution_rb.html +148 -0
- data/doc/files/lib/Variable_rb.html +148 -0
- data/doc/files/lib/extensions_rb.html +108 -0
- data/doc/files/test/AllDifferentConstraintTest_rb.html +158 -0
- data/doc/files/test/BinaryConstraintTest_rb.html +158 -0
- data/doc/files/test/ConstraintListTest_rb.html +160 -0
- data/doc/files/test/ConstraintSolverTest_rb.html +164 -0
- data/doc/files/test/DomainTest_rb.html +156 -0
- data/doc/files/test/ProblemTest_rb.html +160 -0
- data/doc/files/test/SolutionTest_rb.html +159 -0
- data/doc/files/test/TestSuite_rb.html +113 -0
- data/doc/files/test/VariableTest_rb.html +157 -0
- data/doc/files/test/extensionsTest_rb.html +118 -0
- data/doc/fr_class_index.html +51 -0
- data/doc/fr_file_index.html +46 -0
- data/doc/fr_method_index.html +133 -0
- data/doc/index.html +24 -0
- data/examples/example.rb +7 -0
- data/examples/queens.rb +13 -0
- data/examples/soft.rb +14 -0
- data/lib/AbstractConstraint.rb +45 -0
- data/lib/AllDifferentConstraint.rb +160 -0
- data/lib/BinaryConstraint.rb +187 -0
- data/lib/ConstraintList.rb +31 -0
- data/lib/ConstraintSolver.rb +213 -0
- data/lib/Domain.rb +100 -0
- data/lib/GraphUtils.rb +293 -0
- data/lib/OneOfEqualsConstraint.rb +81 -0
- data/lib/Problem.rb +30 -0
- data/lib/Solution.rb +56 -0
- data/lib/TupleConstraint.rb +111 -0
- data/lib/Variable.rb +74 -0
- data/lib/extensions.rb +55 -0
- data/test/AllDifferentConstraintTest.rb +140 -0
- data/test/BinaryConstraintTest.rb +108 -0
- data/test/ConstraintListTest.rb +41 -0
- data/test/ConstraintSolverTest.rb +274 -0
- data/test/DomainTest.rb +83 -0
- data/test/GraphUtilsTest.rb +83 -0
- data/test/OneOfEqualsConstraintTest.rb +82 -0
- data/test/ProblemTest.rb +35 -0
- data/test/SolutionTest.rb +35 -0
- data/test/TestSuite.rb +10 -0
- data/test/TupleConstraintTest.rb +151 -0
- data/test/VariableTest.rb +47 -0
- data/test/extensionsTest.rb +57 -0
- metadata +212 -0
|
@@ -0,0 +1,108 @@
|
|
|
1
|
+
#!/usr/bin/ruby
|
|
2
|
+
|
|
3
|
+
$:.unshift File.join(File.dirname(__FILE__), "..", "lib")
|
|
4
|
+
|
|
5
|
+
require 'test/unit'
|
|
6
|
+
require 'BinaryConstraint'
|
|
7
|
+
require 'Variable'
|
|
8
|
+
require 'Domain'
|
|
9
|
+
|
|
10
|
+
module ConstraintSolver
|
|
11
|
+
class BinaryConstraintTest < Test::Unit::TestCase
|
|
12
|
+
def setup
|
|
13
|
+
@lhs = Variable.new("lhs", Domain.new([ 1, 2 ].to_set))
|
|
14
|
+
@rhs = Variable.new("rhs", Domain.new([ 1, 2 ].to_set))
|
|
15
|
+
@rel = BinaryRelation.new("==")
|
|
16
|
+
@constraint = BinaryConstraint.new(@lhs, @rhs, @rel)
|
|
17
|
+
end
|
|
18
|
+
|
|
19
|
+
def testConstructor
|
|
20
|
+
assert_raise(ArgumentError) { BinaryConstraint.new }
|
|
21
|
+
assert_raise(ArgumentError) { BinaryConstraint.new(@lhs, @rhs, Proc.new { |a| a }) }
|
|
22
|
+
assert_nothing_raised { BinaryConstraint.new(@lhs, @rhs, @rel) }
|
|
23
|
+
assert_nothing_raised { BinaryConstraint.new(@lhs, @rhs, @rel, 0) }
|
|
24
|
+
end
|
|
25
|
+
|
|
26
|
+
def testAssigned
|
|
27
|
+
assert_equal(false, @constraint.allAssigned?)
|
|
28
|
+
@rhs.value = 1
|
|
29
|
+
assert_equal(false, @constraint.allAssigned?)
|
|
30
|
+
@lhs.value = 1
|
|
31
|
+
assert_equal(true, @constraint.allAssigned?)
|
|
32
|
+
@rhs.reset
|
|
33
|
+
@lhs.reset
|
|
34
|
+
end
|
|
35
|
+
|
|
36
|
+
def testInclude
|
|
37
|
+
assert_equal(true, @constraint.include?(@lhs))
|
|
38
|
+
assert_equal(true, @constraint.include?(@rhs))
|
|
39
|
+
assert_equal(false, @constraint.include?(Variable.new("2", [ 3 ].to_set)))
|
|
40
|
+
end
|
|
41
|
+
|
|
42
|
+
def testHolds
|
|
43
|
+
assert_equal(true, @constraint.holds?)
|
|
44
|
+
assert_nothing_raised { @lhs.value = 1 }
|
|
45
|
+
assert_nothing_raised { @rhs.value = 2 }
|
|
46
|
+
assert_equal(false, @constraint.holds?)
|
|
47
|
+
assert_nothing_raised { @rhs.value = 1 }
|
|
48
|
+
assert_equal(true, @constraint.holds?)
|
|
49
|
+
@lhs.reset
|
|
50
|
+
@rhs.reset
|
|
51
|
+
end
|
|
52
|
+
|
|
53
|
+
def testEquals
|
|
54
|
+
assert_equal(BinaryConstraint.new(@lhs, @rhs, @rel), @constraint)
|
|
55
|
+
assert_not_equal(BinaryConstraint.new(@lhs, @rhs, BinaryRelation.new("<")), @constraint)
|
|
56
|
+
assert_not_equal(BinaryConstraint.new(Variable.new("foo", [ 1 ].to_set), @rhs, @rel), @constraint)
|
|
57
|
+
assert_not_equal(BinaryConstraint.new(@lhs, Variable.new("foo", [ 1 ].to_set), @rel), @constraint)
|
|
58
|
+
end
|
|
59
|
+
|
|
60
|
+
def testRevise
|
|
61
|
+
lhs = Variable.new("x", Domain.new([ 1 ].to_set))
|
|
62
|
+
rhs = Variable.new("y", Domain.new([ 1, 2, 3, 4 ].to_set))
|
|
63
|
+
rel = BinaryRelation.new("<")
|
|
64
|
+
constraint = BinaryConstraint.new(lhs, rhs, rel)
|
|
65
|
+
revisedVariables, checks, wipeout = constraint.revise
|
|
66
|
+
assert_equal(false, wipeout)
|
|
67
|
+
assert_equal([ rhs ], revisedVariables)
|
|
68
|
+
assert_equal(4, checks)
|
|
69
|
+
assert_equal([ 2, 3, 4 ].to_set, rhs.values)
|
|
70
|
+
|
|
71
|
+
lhs = Variable.new("x", Domain.new([ 1 ].to_set), 1)
|
|
72
|
+
rhs = Variable.new("y", Domain.new([ 1, 2, 3, 4 ].to_set))
|
|
73
|
+
rel = BinaryRelation.new("<")
|
|
74
|
+
constraint = BinaryConstraint.new(lhs, rhs, rel)
|
|
75
|
+
revisedVariables, checks, wipeout = constraint.revise
|
|
76
|
+
assert_equal(false, wipeout)
|
|
77
|
+
assert_equal([ rhs ], revisedVariables)
|
|
78
|
+
assert_equal(4, checks)
|
|
79
|
+
assert_equal([ 2, 3, 4 ].to_set, rhs.values)
|
|
80
|
+
|
|
81
|
+
lhs = Variable.new("x", Domain.new([ 1 ].to_set), 1)
|
|
82
|
+
rhs = Variable.new("y", Domain.new([ 1, 2, 3, 4 ].to_set), 4)
|
|
83
|
+
rel = BinaryRelation.new("<")
|
|
84
|
+
constraint = BinaryConstraint.new(lhs, rhs, rel)
|
|
85
|
+
revisedVariables, checks, wipeout = constraint.revise
|
|
86
|
+
assert_equal(false, wipeout)
|
|
87
|
+
assert_equal([], revisedVariables)
|
|
88
|
+
assert_equal(0, checks)
|
|
89
|
+
end
|
|
90
|
+
|
|
91
|
+
def testReviseNothing
|
|
92
|
+
lhs = Variable.new("x", Domain.new([ 1, 2, 3 ].to_set))
|
|
93
|
+
rhs = Variable.new("y", Domain.new([ 1, 2, 3 ].to_set))
|
|
94
|
+
rel = BinaryRelation.new("!=")
|
|
95
|
+
constraint = BinaryConstraint.new(lhs, rhs, rel)
|
|
96
|
+
revisedVariables, checks = constraint.revise
|
|
97
|
+
assert_equal([ ], revisedVariables)
|
|
98
|
+
assert_equal(9, checks)
|
|
99
|
+
end
|
|
100
|
+
end
|
|
101
|
+
|
|
102
|
+
class BinaryRelationTest < Test::Unit::TestCase
|
|
103
|
+
def testConstructor
|
|
104
|
+
assert_raise(ArgumentError) { BinaryRelation.new }
|
|
105
|
+
assert_nothing_raised { BinaryRelation.new("<") }
|
|
106
|
+
end
|
|
107
|
+
end
|
|
108
|
+
end
|
|
@@ -0,0 +1,41 @@
|
|
|
1
|
+
#!/usr/bin/ruby
|
|
2
|
+
|
|
3
|
+
$:.unshift File.join(File.dirname(__FILE__), "..", "lib")
|
|
4
|
+
|
|
5
|
+
require 'test/unit'
|
|
6
|
+
require 'ConstraintList'
|
|
7
|
+
require 'BinaryConstraint'
|
|
8
|
+
require 'Variable'
|
|
9
|
+
require 'Domain'
|
|
10
|
+
require 'AllDifferentConstraint'
|
|
11
|
+
|
|
12
|
+
module ConstraintSolver
|
|
13
|
+
class ConstraintListTest < Test::Unit::TestCase
|
|
14
|
+
def setup
|
|
15
|
+
@var1 = Variable.new("test1", Domain.new([ 1 ].to_set), 1)
|
|
16
|
+
@var2 = Variable.new("test2", Domain.new([ 1 ].to_set), 1)
|
|
17
|
+
@var3 = Variable.new("test3", Domain.new([ 1 ].to_set))
|
|
18
|
+
|
|
19
|
+
@proc = Proc.new {|a, b| a == b }
|
|
20
|
+
|
|
21
|
+
@con1 = BinaryConstraint.new(@var1, @var2, @proc)
|
|
22
|
+
@con2 = BinaryConstraint.new(@var1, @var3, @proc)
|
|
23
|
+
|
|
24
|
+
@cl = ConstraintList.new([ @con1, @con2 ])
|
|
25
|
+
end
|
|
26
|
+
|
|
27
|
+
def testNotAllAssignedWithVariable
|
|
28
|
+
assert_equal(ConstraintList.new([ @con2 ]), @cl.notAllAssignedWithVariable(@var1))
|
|
29
|
+
end
|
|
30
|
+
|
|
31
|
+
def testAllWithVariable
|
|
32
|
+
assert_equal(ConstraintList.new([ @con1, @con2 ]), @cl.allWithVariable(@var1))
|
|
33
|
+
end
|
|
34
|
+
|
|
35
|
+
def testAllDifferentConstraintList
|
|
36
|
+
allDiff = AllDifferentConstraint.new([ @var1, @var2, @var3 ])
|
|
37
|
+
list = ConstraintList.new([ allDiff ])
|
|
38
|
+
assert_equal(list, list.notAllAssignedWithVariable(@var1))
|
|
39
|
+
end
|
|
40
|
+
end
|
|
41
|
+
end
|
|
@@ -0,0 +1,274 @@
|
|
|
1
|
+
#!/usr/bin/ruby
|
|
2
|
+
|
|
3
|
+
$:.unshift File.join(File.dirname(__FILE__), "..", "lib")
|
|
4
|
+
|
|
5
|
+
require 'test/unit'
|
|
6
|
+
require 'log4r'
|
|
7
|
+
require 'ConstraintSolver'
|
|
8
|
+
|
|
9
|
+
include Log4r
|
|
10
|
+
|
|
11
|
+
module ConstraintSolver
|
|
12
|
+
class ConstraintSolverTest < Test::Unit::TestCase
|
|
13
|
+
def setup
|
|
14
|
+
@var1 = Variable.new("x", Domain.new([ 1, 2 ].to_set), nil, 1)
|
|
15
|
+
@var2 = Variable.new("y", Domain.new([ 1, 2 ].to_set), nil, 2)
|
|
16
|
+
@var3 = Variable.new("z", Domain.new([ 1, 2 ].to_set), nil, 3)
|
|
17
|
+
relation = BinaryRelation.new("!=")
|
|
18
|
+
constraint1 = BinaryConstraint.new(@var1, @var2, relation)
|
|
19
|
+
constraint2 = BinaryConstraint.new(@var1, @var3, relation.clone)
|
|
20
|
+
constraint3 = BinaryConstraint.new(@var2, @var3, relation.clone)
|
|
21
|
+
@meritMap = { 1 => 2, 2 => 1 }
|
|
22
|
+
@solvableProblem = Problem.new([ @var1, @var2 ], ConstraintList.new([ constraint1 ]), @meritMap)
|
|
23
|
+
@unsolvableProblem = Problem.new([ @var1, @var2, @var3 ],
|
|
24
|
+
ConstraintList.new([ constraint1, constraint2, constraint3 ]))
|
|
25
|
+
@solver = ConstraintSolver.new
|
|
26
|
+
end
|
|
27
|
+
|
|
28
|
+
def testConstructor
|
|
29
|
+
assert_nothing_raised { ConstraintSolver.new }
|
|
30
|
+
end
|
|
31
|
+
|
|
32
|
+
def testSolvableProblem
|
|
33
|
+
#@solver.log.outputters = Outputter.stderr
|
|
34
|
+
solutions, nodeChecks, constraintChecks = @solver.solve(@solvableProblem)
|
|
35
|
+
assert_equal(false, solutions.empty?)
|
|
36
|
+
assert_equal(2, solutions.size)
|
|
37
|
+
@var1.value = 2
|
|
38
|
+
@var2.value = 1
|
|
39
|
+
assert_equal(Solution.new([ @var1, @var2 ], @meritMap), solutions[0])
|
|
40
|
+
assert_equal(5, solutions[0].merit)
|
|
41
|
+
@var1.value = 1
|
|
42
|
+
@var2.value = 2
|
|
43
|
+
assert_equal(Solution.new([ @var1, @var2 ], @meritMap), solutions[1])
|
|
44
|
+
assert_equal(4, solutions[1].merit)
|
|
45
|
+
@var1.reset
|
|
46
|
+
@var2.reset
|
|
47
|
+
assert_equal(4, nodeChecks)
|
|
48
|
+
assert_equal(4, constraintChecks)
|
|
49
|
+
end
|
|
50
|
+
|
|
51
|
+
def testUnsolvableProblem
|
|
52
|
+
#@solver.log.outputters = Outputter.stderr
|
|
53
|
+
solutions, nodeChecks, constraintChecks = @solver.solve(@unsolvableProblem)
|
|
54
|
+
assert_equal(true, solutions.empty?)
|
|
55
|
+
assert_equal(2, nodeChecks)
|
|
56
|
+
assert_equal(10, constraintChecks)
|
|
57
|
+
end
|
|
58
|
+
|
|
59
|
+
def testAllDifferentProblem
|
|
60
|
+
x = Variable.new("x", Domain.new([ 1, 2, 3 ].to_set))
|
|
61
|
+
y = Variable.new("y", Domain.new([ 1, 2, 3 ].to_set))
|
|
62
|
+
z = Variable.new("z", Domain.new([ 1, 2, 3 ].to_set))
|
|
63
|
+
constraint = AllDifferentConstraint.new([ x, y, z ])
|
|
64
|
+
#@solver.log.outputters = Outputter.stderr
|
|
65
|
+
solutions, nodeChecks, constraintChecks = @solver.solve(Problem.new([ x, y, z ], constraint))
|
|
66
|
+
assert_equal(6, solutions.size)
|
|
67
|
+
assert_equal(15, nodeChecks)
|
|
68
|
+
#assert_equal(27, constraintChecks)
|
|
69
|
+
end
|
|
70
|
+
|
|
71
|
+
def testAllDifferentWithoutAllDifferent
|
|
72
|
+
x = Variable.new("x", Domain.new([ 1, 2, 3 ].to_set))
|
|
73
|
+
y = Variable.new("y", Domain.new([ 1, 2, 3 ].to_set))
|
|
74
|
+
z = Variable.new("z", Domain.new([ 1, 2, 3 ].to_set))
|
|
75
|
+
relation = BinaryRelation.new("!=")
|
|
76
|
+
c1 = BinaryConstraint.new(x, y, relation)
|
|
77
|
+
c2 = BinaryConstraint.new(x, z, relation.clone)
|
|
78
|
+
c3 = BinaryConstraint.new(y, z, relation.clone)
|
|
79
|
+
#@solver.log.outputters = Outputter.stderr
|
|
80
|
+
solutions, nodeChecks, constraintChecks =
|
|
81
|
+
@solver.solve(Problem.new([ x, y, z ], ConstraintList.new([ c1, c2, c3 ])))
|
|
82
|
+
assert_equal(6, solutions.size)
|
|
83
|
+
assert_equal(15, nodeChecks)
|
|
84
|
+
assert_equal(48, constraintChecks)
|
|
85
|
+
end
|
|
86
|
+
|
|
87
|
+
def testVariableAndValueOrdering
|
|
88
|
+
meritMap = { "foo" => 1, "bar" => 2, "foobar" => 3 }
|
|
89
|
+
x = Variable.new("x", Domain.new([ "foo", "bar", "foobar" ].to_set), nil, 1)
|
|
90
|
+
y = Variable.new("y", Domain.new([ "foo", "bar", "foobar" ].to_set), nil, 2)
|
|
91
|
+
c = AllDifferentConstraint.new([ x, y ])
|
|
92
|
+
#@solver.log.outputters = Outputter.stderr
|
|
93
|
+
solutions = @solver.solve(Problem.new([ x, y ], c, meritMap))[0]
|
|
94
|
+
assert_equal(6, solutions.size)
|
|
95
|
+
assert_equal(8, solutions[0].merit)
|
|
96
|
+
assert_equal(7, solutions[1].merit)
|
|
97
|
+
assert_equal(7, solutions[2].merit)
|
|
98
|
+
assert_equal(5, solutions[3].merit)
|
|
99
|
+
assert_equal(5, solutions[4].merit)
|
|
100
|
+
assert_equal(4, solutions[5].merit)
|
|
101
|
+
end
|
|
102
|
+
|
|
103
|
+
def testPreemptiveSolving
|
|
104
|
+
x = Variable.new("x", Domain.new([ 1, 2, 3 ].to_set))
|
|
105
|
+
y = Variable.new("y", Domain.new([ 1, 2, 3 ].to_set))
|
|
106
|
+
z = Variable.new("z", Domain.new([ 1, 2 ].to_set))
|
|
107
|
+
constraint = AllDifferentConstraint.new([ x, y, z ])
|
|
108
|
+
#@solver.log.outputters = Outputter.stderr
|
|
109
|
+
allSolutions = @solver.solve(Problem.new([ x, y, z ], constraint))[0]
|
|
110
|
+
assert_equal(4, allSolutions.size)
|
|
111
|
+
firstSolution = @solver.solve(Problem.new([ x, y, z ], constraint, {}, true))[0]
|
|
112
|
+
assert_equal(1, firstSolution.size)
|
|
113
|
+
assert_equal(allSolutions[0], firstSolution[0])
|
|
114
|
+
end
|
|
115
|
+
|
|
116
|
+
def testPartialAssignment
|
|
117
|
+
x = Variable.new("x", Domain.new([ 1, 2, 3 ].to_set), 1)
|
|
118
|
+
y = Variable.new("y", Domain.new([ 1, 2, 3 ].to_set))
|
|
119
|
+
z = Variable.new("z", Domain.new([ 1, 2, 3 ].to_set))
|
|
120
|
+
constraint = AllDifferentConstraint.new([ x, y, z ])
|
|
121
|
+
#@solver.log.outputters = Outputter.stderr
|
|
122
|
+
solutions = @solver.solve(Problem.new([ x, y, z ], constraint))[0]
|
|
123
|
+
assert_equal(2, solutions.size)
|
|
124
|
+
end
|
|
125
|
+
|
|
126
|
+
def testSeveralAllDiff
|
|
127
|
+
a = Variable.new("11", Domain.new([ 1, 2 ].to_set))
|
|
128
|
+
b = Variable.new("12", Domain.new([ 1, 2 ].to_set), 2)
|
|
129
|
+
c = Variable.new("21", Domain.new([ 1, 2 ].to_set))
|
|
130
|
+
d = Variable.new("22", Domain.new([ 1, 2 ].to_set), 2)
|
|
131
|
+
constraints = ConstraintList.new
|
|
132
|
+
constraints << AllDifferentConstraint.new([ a, b ])
|
|
133
|
+
constraints << AllDifferentConstraint.new([ c, d ])
|
|
134
|
+
constraints << AllDifferentConstraint.new([ a, c ])
|
|
135
|
+
constraints << AllDifferentConstraint.new([ b, d ])
|
|
136
|
+
solutions = @solver.solve(Problem.new([ a, b, c, d ], constraints))[0]
|
|
137
|
+
assert_equal(0, solutions.size)
|
|
138
|
+
end
|
|
139
|
+
|
|
140
|
+
def testSoftConstraints
|
|
141
|
+
x = Variable.new("x", Domain.new([ 1 ].to_set))
|
|
142
|
+
y = Variable.new("y", Domain.new([ 1 ].to_set))
|
|
143
|
+
constraints = ConstraintList.new
|
|
144
|
+
constraints << BinaryConstraint.new(x, y, BinaryRelation.new("!="), 0.5)
|
|
145
|
+
problem = Problem.new([ x, y ], constraints, {}, false, 1)
|
|
146
|
+
#@solver.log.outputters = Outputter.stderr
|
|
147
|
+
solutions, nodeChecks, constraintChecks = @solver.solve(problem)
|
|
148
|
+
assert_equal(1, solutions.size)
|
|
149
|
+
assert_equal(1, solutions[0].variables[0].value)
|
|
150
|
+
assert_equal(1, solutions[0].variables[1].value)
|
|
151
|
+
assert_equal(0.5, solutions[0].violation)
|
|
152
|
+
assert_equal(4, nodeChecks)
|
|
153
|
+
assert_equal(1, constraintChecks)
|
|
154
|
+
|
|
155
|
+
x.value = 1
|
|
156
|
+
y.value = 1
|
|
157
|
+
#@solver.log.outputters = Outputter.stderr
|
|
158
|
+
solutions, nodeChecks, constraintChecks = @solver.solve(problem)
|
|
159
|
+
assert_equal(1, solutions.size)
|
|
160
|
+
assert_equal(1, solutions[0].variables[0].value)
|
|
161
|
+
assert_equal(1, solutions[0].variables[1].value)
|
|
162
|
+
assert_equal(0.5, solutions[0].violation)
|
|
163
|
+
assert_equal(2, nodeChecks)
|
|
164
|
+
assert_equal(1, constraintChecks)
|
|
165
|
+
end
|
|
166
|
+
|
|
167
|
+
def testComplexSoftConstraints
|
|
168
|
+
a = Variable.new("a", Domain.new([ 1, 2, 3 ].to_set))
|
|
169
|
+
b = Variable.new("b", Domain.new([ 1, 2, 3 ].to_set))
|
|
170
|
+
c = Variable.new("c", Domain.new([ 1, 2, 3 ].to_set))
|
|
171
|
+
d = Variable.new("d", Domain.new([ 1, 2, 3 ].to_set))
|
|
172
|
+
constraints = ConstraintList.new
|
|
173
|
+
constraints << AllDifferentConstraint.new([ a, b, c, d ], 0.1)
|
|
174
|
+
rel = BinaryRelation.new("<")
|
|
175
|
+
constraints << BinaryConstraint.new(a, b, rel, 0.5)
|
|
176
|
+
constraints << BinaryConstraint.new(b, c, rel, 0.5)
|
|
177
|
+
constraints << BinaryConstraint.new(c, d, rel, 0.5)
|
|
178
|
+
problem = Problem.new([ a, b, c, d ], constraints, {}, false, 1)
|
|
179
|
+
#@solver.log.outputters = Outputter.stderr
|
|
180
|
+
solutions, nodeChecks, constraintChecks = @solver.solve(problem)
|
|
181
|
+
assert_equal(15, solutions.size)
|
|
182
|
+
assert_equal(90, nodeChecks)
|
|
183
|
+
assert_equal(220, constraintChecks)
|
|
184
|
+
solutions.each { |solution|
|
|
185
|
+
assert_equal(0.6, solution.violation)
|
|
186
|
+
}
|
|
187
|
+
end
|
|
188
|
+
|
|
189
|
+
def testTimeLimitHardConstraints
|
|
190
|
+
x = Variable.new("x", Domain.new([ 1, 2, 3 ].to_set))
|
|
191
|
+
y = Variable.new("y", Domain.new([ 1, 2, 3 ].to_set))
|
|
192
|
+
z = Variable.new("z", Domain.new([ 1, 2, 3 ].to_set))
|
|
193
|
+
relation = BinaryRelation.new("!=")
|
|
194
|
+
c1 = BinaryConstraint.new(x, y, relation)
|
|
195
|
+
c2 = BinaryConstraint.new(x, z, relation.clone)
|
|
196
|
+
c3 = BinaryConstraint.new(y, z, relation.clone)
|
|
197
|
+
#@solver.log.outputters = Outputter.stderr
|
|
198
|
+
solutions, nodeChecks, constraintChecks =
|
|
199
|
+
@solver.solve(Problem.new([ x, y, z ], ConstraintList.new([ c1, c2, c3 ])), 0.000001)
|
|
200
|
+
assert_equal(1, solutions.size)
|
|
201
|
+
assert_equal(-3, solutions[0].merit)
|
|
202
|
+
assert_equal(3, solutions[0].violation)
|
|
203
|
+
end
|
|
204
|
+
|
|
205
|
+
def testTimeLimitSoftConstraints
|
|
206
|
+
x = Variable.new("x", Domain.new([ 1, 2, 3 ].to_set))
|
|
207
|
+
y = Variable.new("y", Domain.new([ 1, 2, 3 ].to_set))
|
|
208
|
+
z = Variable.new("z", Domain.new([ 1, 2, 3 ].to_set))
|
|
209
|
+
relation = BinaryRelation.new("!=")
|
|
210
|
+
c1 = BinaryConstraint.new(x, y, relation, 0.2)
|
|
211
|
+
c2 = BinaryConstraint.new(x, z, relation.clone, 0.5)
|
|
212
|
+
c3 = BinaryConstraint.new(y, z, relation.clone, 1)
|
|
213
|
+
#@solver.log.outputters = Outputter.stderr
|
|
214
|
+
# Depending on the time limit and the particular machine,
|
|
215
|
+
# constraints will be discarded. Change the value and enable logging
|
|
216
|
+
# to see for yourself.
|
|
217
|
+
timeLimit = 0.0014
|
|
218
|
+
solutions, nodeChecks, constraintChecks =
|
|
219
|
+
@solver.solve(Problem.new([ x, y, z ], ConstraintList.new([ c1, c2, c3 ]), {}, true, 1), timeLimit)
|
|
220
|
+
assert_equal(1, solutions.size)
|
|
221
|
+
end
|
|
222
|
+
|
|
223
|
+
def testTimeLimitSoftAllDiff
|
|
224
|
+
x = Variable.new("x", Domain.new([ 1, 2 ].to_set))
|
|
225
|
+
y = Variable.new("y", Domain.new([ 1, 2 ].to_set))
|
|
226
|
+
constraint = AllDifferentConstraint.new([ x, y ], 1)
|
|
227
|
+
#@solver.log.outputters = Outputter.stderr
|
|
228
|
+
solutions, nodeChecks, constraintChecks = @solver.solve(Problem.new([ x, y ], constraint,
|
|
229
|
+
{ 1 => 1, 2 => 2 }, false, 0), 10)
|
|
230
|
+
assert_equal(2, solutions.size)
|
|
231
|
+
assert_equal(4, nodeChecks)
|
|
232
|
+
end
|
|
233
|
+
|
|
234
|
+
def testTupleConstraint
|
|
235
|
+
x = Variable.new("x", Domain.new([ 1, 2, 3 ].to_set))
|
|
236
|
+
y = Variable.new("y", Domain.new([ 1, 2, 3 ].to_set))
|
|
237
|
+
z = Variable.new("z", Domain.new([ 1, 2, 3 ].to_set))
|
|
238
|
+
constraint = TupleConstraint.new([ x, y, z ], [ [ 1, 2, 3 ], [ 3, 2, 1 ] ])
|
|
239
|
+
#@solver.log.outputters = Outputter.stderr
|
|
240
|
+
solutions, nodeChecks, constraintChecks = @solver.solve(Problem.new([ x, y, z ], constraint))
|
|
241
|
+
assert_equal(2, solutions.size)
|
|
242
|
+
assert_equal(7, nodeChecks)
|
|
243
|
+
assert_equal(0, constraintChecks)
|
|
244
|
+
|
|
245
|
+
assert_equal(1, solutions[0].variables[0].value)
|
|
246
|
+
assert_equal(2, solutions[0].variables[1].value)
|
|
247
|
+
assert_equal(3, solutions[0].variables[2].value)
|
|
248
|
+
|
|
249
|
+
assert_equal(3, solutions[1].variables[0].value)
|
|
250
|
+
assert_equal(2, solutions[1].variables[1].value)
|
|
251
|
+
assert_equal(1, solutions[1].variables[2].value)
|
|
252
|
+
end
|
|
253
|
+
|
|
254
|
+
def testOneOfEqualsConstraint
|
|
255
|
+
x = Variable.new("x", Domain.new([ 1, 2 ].to_set))
|
|
256
|
+
y = Variable.new("y", Domain.new([ 1, 2 ].to_set))
|
|
257
|
+
constraint = OneOfEqualsConstraint.new([ x, y ], 2)
|
|
258
|
+
#@solver.log.outputters = Outputter.stderr
|
|
259
|
+
solutions, nodeChecks, constraintChecks = @solver.solve(Problem.new([ x, y ], constraint))
|
|
260
|
+
assert_equal(3, solutions.size)
|
|
261
|
+
assert_equal(5, nodeChecks)
|
|
262
|
+
assert_equal(0, constraintChecks)
|
|
263
|
+
|
|
264
|
+
assert_equal(1, solutions[0].variables[0].value)
|
|
265
|
+
assert_equal(2, solutions[0].variables[1].value)
|
|
266
|
+
|
|
267
|
+
assert_equal(2, solutions[1].variables[0].value)
|
|
268
|
+
assert_equal(1, solutions[1].variables[1].value)
|
|
269
|
+
|
|
270
|
+
assert_equal(2, solutions[2].variables[0].value)
|
|
271
|
+
assert_equal(2, solutions[2].variables[1].value)
|
|
272
|
+
end
|
|
273
|
+
end
|
|
274
|
+
end
|
data/test/DomainTest.rb
ADDED
|
@@ -0,0 +1,83 @@
|
|
|
1
|
+
#!/usr/bin/ruby
|
|
2
|
+
|
|
3
|
+
$:.unshift File.join(File.dirname(__FILE__), "..", "lib")
|
|
4
|
+
|
|
5
|
+
require 'test/unit'
|
|
6
|
+
require 'Domain'
|
|
7
|
+
|
|
8
|
+
module ConstraintSolver
|
|
9
|
+
class DomainTest < Test::Unit::TestCase
|
|
10
|
+
def setup
|
|
11
|
+
@domain = Domain.new([ 2, 3, 4 ].to_set)
|
|
12
|
+
end
|
|
13
|
+
|
|
14
|
+
def testConstructor
|
|
15
|
+
assert_nothing_raised { Domain.new }
|
|
16
|
+
assert_raise(ArgumentError) { Domain.new(3) }
|
|
17
|
+
assert_raise(ArgumentError) { Domain.new([ 2 ]) }
|
|
18
|
+
assert_nothing_raised { Domain.new([ 2 ].to_set) }
|
|
19
|
+
assert_nothing_raised { Domain.new([ 2, 3, 4 ].to_set) }
|
|
20
|
+
end
|
|
21
|
+
|
|
22
|
+
def testDomainAddDelete
|
|
23
|
+
domain = Domain.new
|
|
24
|
+
assert(domain.empty?)
|
|
25
|
+
domain << 3
|
|
26
|
+
assert(domain.include?(3))
|
|
27
|
+
domain.delete(3)
|
|
28
|
+
assert(domain.empty?)
|
|
29
|
+
end
|
|
30
|
+
|
|
31
|
+
def testPruneSet
|
|
32
|
+
@domain.prune([ 2 ].to_set)
|
|
33
|
+
assert_equal([ 3, 4 ].to_set, @domain.values)
|
|
34
|
+
@domain.prune([ 3 ].to_set)
|
|
35
|
+
assert_equal([ 4 ].to_set, @domain.values)
|
|
36
|
+
@domain.undoPruning
|
|
37
|
+
assert_equal([ 3, 4 ].to_set, @domain.values)
|
|
38
|
+
@domain.undoPruning
|
|
39
|
+
assert_equal([ 2, 3, 4 ].to_set, @domain.values)
|
|
40
|
+
|
|
41
|
+
@domain.prune([ 2, 3 ].to_set)
|
|
42
|
+
assert_equal([ 4 ].to_set, @domain.values)
|
|
43
|
+
begin
|
|
44
|
+
@domain.prune([ 4 ].to_set)
|
|
45
|
+
rescue DomainWipeoutException
|
|
46
|
+
assert_equal([].to_set, @domain.values)
|
|
47
|
+
end
|
|
48
|
+
@domain.undoPruning
|
|
49
|
+
assert_equal([ 4 ].to_set, @domain.values)
|
|
50
|
+
@domain.undoPruning
|
|
51
|
+
assert_equal([ 2, 3, 4 ].to_set, @domain.values)
|
|
52
|
+
end
|
|
53
|
+
|
|
54
|
+
def testPruneScalar
|
|
55
|
+
@domain.prune(2)
|
|
56
|
+
assert_equal([ 3, 4 ].to_set, @domain.values)
|
|
57
|
+
@domain.undoPruning
|
|
58
|
+
assert_equal([ 2, 3, 4 ].to_set, @domain.values)
|
|
59
|
+
end
|
|
60
|
+
|
|
61
|
+
def testPruneWithErrors
|
|
62
|
+
assert_raise(UndoStackEmptyException) { @domain.undoPruning }
|
|
63
|
+
assert_raise(DomainWipeoutException) { @domain.prune([ 2, 3, 4 ].to_set) }
|
|
64
|
+
end
|
|
65
|
+
|
|
66
|
+
def testPruneWipeout
|
|
67
|
+
begin
|
|
68
|
+
@domain.prune([ 2, 3, 4 ].to_set)
|
|
69
|
+
rescue DomainWipeoutException
|
|
70
|
+
assert_equal(Set.new, @domain.values)
|
|
71
|
+
return
|
|
72
|
+
end
|
|
73
|
+
fail
|
|
74
|
+
end
|
|
75
|
+
|
|
76
|
+
def testEquals
|
|
77
|
+
assert_equal(@domain, Domain.new([ 2, 3, 4 ].to_set))
|
|
78
|
+
assert_not_equal(@domain, Domain.new([ 2, 3 ].to_set))
|
|
79
|
+
@domain.prune(4)
|
|
80
|
+
assert_not_equal(@domain, Domain.new([ 2, 3 ].to_set))
|
|
81
|
+
end
|
|
82
|
+
end
|
|
83
|
+
end
|