Backjumping is a technique used in the context of constraint satisfaction problems (CSPs) and search algorithms, particularly within the field of artificial intelligence and operations research. It is an optimization of backtracking search methods. In standard backtracking, when the algorithm encounters a conflict or dead end, it typically backtracks to the last variable decision and explores other possible values.
Articles by others on the same topic
There are currently no matching articles.