Top- Based Adaptive Enumeration in Constraint Programming

Table 6

Number of backtracks solving magic squares, Sudoku, and the knight problem with different strategies.

Strategy	MS	MS	Sudoku	Knight	Knight
	()	()		()	()
	12	910	18	767	19,818
	1,191	46,675	10439	42,889	43,098
	3	185	4	767	19,818
	10	5,231	18	18,838	19,716
	51	46,299	2	767	19,818
	42	44,157	6,541	42,889	43,098
	3	29,416	9	767	19,818
	29	21,847	2	18,840	19,716
HH-GA	0	7	2	8,190	4,105
HH-PSO	4	53	826	667	29,608
Top-	1	207	2,744	613	6,835