Skip to main content
. Author manuscript; available in PMC: 2010 Oct 25.
Published in final edited form as: Ann Math Artif Intell. 2008 Nov 1;54(1-3):3–51. doi: 10.1007/s10472-009-9132-y

Table 8. AND/OR search vs. OR search vs. bucket elimination; random networks; averages over 20 instances.

N=40, K=3, C=50, S=3, 20 instances, w*=13, h=20
t 10% 20% 30% 40% 50% 60%
# solutions 0 0 0 0 46582 147898575
Time (seconds)
BE 8.674 8.714 8.889 8.709 8.531 8.637
i=0 A/O FC 0.011 0.030 0.110 0.454 3.129 32.931
OR FC 0.009 0.031 0.113 0.511 14.615 9737.823
i=3 A/O FC 0.011 0.031 0.111 0.453 3.103 31.277
OR FC 0.009 0.030 0.112 0.509 14.474 9027.365
i=6 A/O FC 0.011 0.029 0.110 0.454 3.006 25.140
OR FC 0.010 0.032 0.113 0.508 13.842 7293.472
i=9 A/O FC 0.010 0.030 0.114 0.453 2.895 21.558
OR FC 0.010 0.031 0.111 0.509 12.336 5809.917
i=13 A/O FC 0.011 0.030 0.111 0.457 2.605 11.974
OR FC 0.010 0.032 0.123 0.494 8.703 1170.203
Number of expanded nodes (# n) / Number of dead-ends (# d)
# n # d # n # d # n # d # n # d # n # d # n # d
i=0 A/OFC 78 159 265 533 999 1994 4735 9229 60163 101135 1601674 1711947
ORFC 78 159 265 533 1000 2003 4947 9897 273547 407350 384120807 324545908
i=3 A/OFC 78 159 265 533 986 1990 4525 9166 46763 98413 689154 1625075
ORFC 78 159 265 533 1000 2003 4947 9897 224739 399210 228667363 287701079
i=6 A/OFC 78 159 265 533 981 1971 4467 8991 41876 85583 487320 917612
ORFC 78 159 265 533 1000 2003 4947 9897 185422 329754 141610990 208159068
i=9 A/OFC 78 159 265 533 981 1958 4451 8866 37314 70337 362024 580325
ORFC 78 159 265 533 1000 2003 4947 9897 147329 270446 102316417 135655353
i=13 A/OFC 78 159 265 533 981 1955 4415 8533 30610 50228 170827 181157
ORFC 78 159 265 533 999 1994 4761 9283 99923 176630 16210028 20018823