This is the illustration of the Backjumping algorithm for four queens exhaustive study of essential constraint satisfaction problem techniques based on N-Queens problem .I am confused whether this is backjumping,or conflicted direct backjumping or graph-based backjumping.Which one is it?
0
$\begingroup$
$\endgroup$
-1
$\begingroup$
$\endgroup$
I think this article use gaschnig backjumping algorithm.
-
1$\begingroup$ While I appreciate that you try solve your own problem, we want answers to not just make a claim, but explain or argue why it holds. Can you improve your answer by explaining why this particular algorithm is used? $\endgroup$ – Discrete lizard♦ Feb 13 at 15:25
