Table 4. AND/OR search algorithms (1): random networks; induced width 12; pseudo tree depth 19; averages taken over 20 instances.

N=40, K=2, R=2, P=2, C=10, S=4, 20 instances, w*=12, h=19
t	i	Time AO-			Nodes (*1000) AO-			Dead-ends (*1000) AO-			#sol
		C	FC	RFC	C	FC	RFC	C	FC	RFC
20	0	0.671	0.056	0.022	153	4	1	95	3	1	2E+05
	3	0.619	0.053	0.019	101	3	1	95	3	1
	6	0.479	0.055	0.022	75	3	1	57	3	1
	9	0.297	0.053	0.019	52	3	1	10	3	1
	12	0.103	0.044	0.016	17	2	1	3	2	0
40	0	2.877	0.791	1.094	775	168	158	240	40	36	8E+07
	3	2.426	0.663	0.894	330	57	52	240	40	36
	6	1.409	0.445	0.544	183	35	32	107	28	24
	9	0.739	0.301	0.338	119	24	21	20	12	10
	12	0.189	0.142	0.149	28	9	7	3	4	3
60	0	6.827	4.717	7.427	1,975	1,159	1,148	362	163	159	6E+09
	3	5.560	3.908	6.018	673	351	346	362	163	159
	6	2.809	2.219	3.149	347	184	180	151	89	86
	9	1.334	1.196	1.535	204	106	102	19	25	23
	12	0.255	0.331	0.425	36	23	22	3	5	5
80	0	14.181	14.199	21.791	4,283	3,704	3,703	370	278	277	1E+11
	3	11.334	11.797	17.916	1,320	1,109	1,107	370	278	277
	6	5.305	6.286	9.061	626	519	518	128	98	97
	9	2.204	2.890	3.725	336	274	273	17	21	20
	12	0.318	0.543	0.714	44	40	40	1	3	3
100	0	23.595	27.129	41.744	7,451	7,451	7,451	0	0	0	1E+12
	3	19.050	22.842	34.800	2,161	2,161	2,161	0	0	0
	6	8.325	11.528	16.636	957	957	957	0	0	0
	9	3.153	4.863	6.255	484	484	484	0	0	0
	12	0.366	0.681	0.884	51	51	51	0	0	0