-
Notifications
You must be signed in to change notification settings - Fork 0
/
naive_tests.py
65 lines (50 loc) · 977 Bytes
/
naive_tests.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
from ValsingLinks0 import ValsingLinks
from time import time
### NAIVE TEST
A0 = [[1, 0, 0, 0],
[0, 1, 1, 1]]
A = [[0, 0, 0, 1],
[0, 1, 1, 1],
[0, 1, 1, 0],
[1, 0, 0, 1],
[1, 1, 1, 1],
[1, 0, 0, 0],
[1, 1, 1, 0]]
'''
0001
1110
1001
0110
1000
0110
0001
1000
0111
1111
'''
C = list(reversed(A))
B = [[0, 0, 1, 1, 0, 0],
[1, 1, 0, 0, 0, 0],
[0, 0, 0, 1, 1, 0],
[1, 1, 1, 0, 0, 0],
[0, 0, 0, 1, 1, 0],
[0, 0, 0, 0, 1, 1],
[1, 0, 1, 0, 1, 1]]
# B and D have 1 solution (not counting ordering)
D = list(reversed(B))
time_res = []
for i, problem in enumerate([A,B,C,D]):
X = ValsingLinks(problem)
start = time()
for _ in range(10000): #10k
X.solve()
X.solutions = set()
end = time()
X.solve()
print(len(X.solutions))
print(X.solutions)
time_res.append(end-start)
print()
for i, duration in enumerate(time_res):
print(i+1, ":\t",duration)
print()