I am building N-Queen Solver with java. I confused with AC-3 algorithm. I heard that AC-3 can be applied with backtracking algorithm before processing and during the search.The latter is called MAC-3 algorithm.
I have achieved the MAC-3 algorithm.
But,I observed that AC-3 with backtracking algorithm before processing does not do at all.Moreover,it consumes more time than naive backtracking algorithm.
If so,is it sense to combine AC-3 algorithm with forward checking algorithm? Is there any other ways to use AC-3 algorithm that makes efficient?