-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.py
28 lines (17 loc) · 825 Bytes
/
main.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
import sys
from search import *
from csp import *
from problem import *
def main():
guest = ['Antonella', 'Domenico', 'Raffella', 'Tommaso', 'Vincenzo', 'Azzurra',
'Cristiano', 'Francesca', 'Luigi', 'Giovanni', 'Marcella', 'Daniela', 'Leonardo', 'Nunzio', 'Silvia']
family1 = ['Antonella', 'Domenico', 'Raffella', 'Tommaso', 'Vincenzo']
family2 = ['Azzurra', 'Cristiano', 'Francesca', 'Luigi']
fight = [('Giovanni', 'Marcella'), ('Marcella', 'Daniela'), ('Luigi', 'Leonardo')]
family = [family1, family2]
room = CSP(guest, fight, family, 3, 6)
print(backtracking_search(room, selected_unassigned_value=minimum_remaining_value,
ordered_value=least_constraining_value, inference=AC3))
return 0
if __name__ == '__main__':
sys.exit(main())