17 Feb 2005
CS 3243 - Constraint Satisfaction
13
CSP Search tree size
b = (n - l )d at depth l, hence n! · dn leaves
{}
Variables: A,B,C,D
Domains: 1,2,3
A=1
A=2
D=3
…
B=1
…
A=1,
B=1
B=1
A=1,
B=2
B=2
A=1,
C=1
C=1
A=1,
D=3
D=3
…
…
Depth 1: 4 variables x 3
domains
= 12 states
= 12 states
Depth 2: 3 variables x 3
domains
= 9 states
= 9 states
Depth 3: 2 variables x 3
domains
= 6 states
= 6 states
Depth 4: 1 variable x 3 domains
= 3 states (leaf level)
= 3 states (leaf level)