Top- Based Adaptive Enumeration in Constraint Programming

Table 5

Number of backtracks solving different instances of the N-queens problem with different strategies.

Strategy	NQ	NQ	NQ	NQ	NQ	NQ
	()	()	()	()	()	()
	10	6	15	73	10,026	27,406
	11	12	11	808	2,539	39,232
	10	4	16	1	11	177
	10	6	15	73	10,026	26,405
	10	6	15	73	10,026	27,406
	11	12	11	808	2,539	39,232
	10	4	16	1	11	177
	10	6	15	73	10,026	26,405
HH-GA	4	6	4	73	0	7
HH-PSO	6	2	16	11	11	252
Top-	5	2	2	13	18	212