Talk:Backjumping

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

Low

This article has been rated as Low-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

NCB/DDB[edit]

Is this the same thing as nonchronological or dependency-directed backtracking?

They are related, though they have slightly different nuances. As far as I can recall, the main difference is in how they record the relations between the current and previous variables in order to backtrack. Diego (talk) 05:46, 19 August 2008 (UTC)[reply]

Applications[edit]

In what applications is this technique actually used? -- Beland (talk) 17:51, 17 August 2008 (UTC)[reply]

Almost any modern automatic problem solver based on branch and bound must use a variant of this technique. Diego (talk) 05:49, 19 August 2008 (UTC)[reply]

Clarity[edit]

This really needs cleaning up. Some of the explanations here are very complicated - at least, moreso than they need to be. I'd also question the bit which says that conflict-directed backtracking was invented in 1993. I'm almost certain this stuff has been around since the 1970s. —Preceding unsigned comment added by 86.189.4.43 (talk) 16:28, 3 January 2010 (UTC)[reply]

Do you have some references, or at least some idea of which field had something similar? Prosser 93 is well known as a seminal work in the context of CSPs. I don't doubt similar ideas were tried earlier, but I don't know any earlier paper where problems were described in the abstract CSP form and direct conflicts were recorded during search. Also, it might be that the technique you know was slightly different than Prosser's, which is the one giving its name to CBJ. Diego (talk) 19:49, 3 January 2010 (UTC)[reply]

Gashnik's phd thesis was the first attempt at conflict-directed backjumping (but only from leaf nodes) AFAIK 213.174.214.36 (talk) 17:13, 8 September 2017 (UTC)[reply]