| CSP Search
tree size |
| b = (n - l )d at
depth l, hence n! · dn leaves |
|
|
| Variables:
A,B,C,D |
|
| Domains: 1,2,3 |
|
|
|
| Depth 1: 4
variables x 3 domains |
|
| = 12 states |
|
| … |
| … |
|
|
| Depth 2: 3
variables x 3 domains |
|
| = 9 states |
|
| … |
| … |
|
|
| Depth 3: 2
variables x 3 domains |
|
| = 6 states |
|
|
|
| Depth 4: 1
variable x 3 domains |
|
| = 3 states (leaf level) |
|
