Table 5. AND/OR search algorithms (2): random networks; induced width 28 and 41; pseudo tree depth 38 and 51; averages over 20 instances.

t	i	Time		Nodes (*1000)		Dead-ends (*1000)		#sol
		AO-FC	AO-RFC	AO-FC	AO-RFC	AO-FC	AO-RFC
N=100, K=2, R=10, P=2, C=30, S=3, 20 instances, w*=28, h=38
10	0	1.743	1.743	15	15	15	15	0
	10	1.748	1.746	15	15	15	15
	20	1.773	1.784	15	15	15	15
20	0	3.193	3.201	28	28	28	28	0
	10	3.195	3.200	28	28	28	28
	20	3.276	3.273	28	28	28	28
30	0	69.585	62.911	805	659	805	659	0
	10	69.803	62.908	805	659	805	659
	20	69.275	63.055	805	659	687	659
N=100, K=2, R=5, P=3, C=40, S=3, 20 instances, w*=41, h=51
10	0	1.251	0.382	7	2	7	2	0
	10	1.249	0.379	7	2	7	2
	20	1.265	0.386	7	2	7	2
20	0	22.992	15.955	164	113	163	111	0
	10	22.994	15.978	162	110	162	111
	20	22.999	16.047	162	110	162	110
30	0	253.289	43.255	2093	351	2046	304	0
	10	254.250	42.858	2026	283	2032	289
	20	253.439	43.228	2020	278	2026	283