Top- Based Adaptive Enumeration in Constraint Programming

Table 3

Runtime in ms for different instances of the N-queens problem with different strategies.

Strategy	NQ	NQ	NQ	NQ	NQ	NQ
	()	()	()	()	()	()
	12	13	20	86	21,027	t.o.
	8	35	30	815	6,315	t.o.
	7	10	25	4	17	962
	15	11	23	54	21,945	t.o.
	17	9	21	56	21,319	t.o.
	12	12	17	778	5,561	t.o.
	9	6	19	3	18	987
	11	6	18	47	21,297	t.o.
HH-GA	151	124	285	215	2,358	21,009
HH-PSO	113	123	201	145	1,068	20,340
Top-	5	4	7	18	110	2,845