Top- Based Adaptive Enumeration in Constraint Programming

Table 4

Runtime in ms for magic squares, Sudoku, and the knight problem with different strategies.

Strategy	MS	MS	Sudoku	Knight	Knight
	()	()		()	()
	21	1,216	8	1,321	t.o.
	2,093	t.o.	3,644	t.o.	t.o.
	5	318	7	1,352	t.o.
	14	7,505	7	t.o.	t.o.
	67	t.o.	11	1,326	t.o.
	36	t.o.	2,127	t.o.	t.o.
	88	t.o.	18	1,751	t.o.
	31	t.o.	17	t.o.	t.o.
HH-GA	158	1,591	1,631	2,615	12,928
HH-PSO	327	1,868,453	234	85,574	11,547
Top-	7	857	6,349	2,553	8,931