Algorithm Design & Analysis

SE 208
Unit 4 -7 Backtracking

Divyashikha Sethia
[email protected]
DTU
 Backtracking

• Backtracking solves problem in which sequence of objects is

chosen from specified set so that sequence satisfies some
criterion.
• Uses Brute Force – all solutions and then pick desired solution
• Not for optimization – multiple solution
• Desired solution expressed as an n-tuple (x1, . . . . , xn) where
each xi Є S, S being finite set.
• Find one or more vectors that maximize, minimize, or satisfy a
criterion function P (x1, . . . . . , xn).
• Form solution and check at every step if this has any chance of
success. If solution at any point seems not promising, ignore it.

Divyashikha Sethia (DTU)

11-2
➢ All solutions requires a set of constraints divided into
two categories: explicit and implicit constraints.
• Definition 1: Explicit constraints rules that restrict each xi to
take on values only from a given set. Explicit constraints
depend on the particular instance I of problem being solved. All
tuples that satisfy the explicit constraints define a possible
solution space for I.
• Definition 2: Implicit constraints are rules that determine which
of the tuples in the solution space of I satisfy the criterion
function. Thus, implicit constraints describe the way in which
the xi‟s must relate to each other.

Divyashikha Sethia (DTU)

11-3
 Example
• How to arrange students B1, B2, G1 3
chairs 3!

Divyashikha Sethia (DTU)

11-4
• Backtracking – for constraints find
solutions that satisfy no girl in middle

Killed bounding
solution

Divyashikha Sethia (DTU)

11-5
• Backtracking is a modified depth first search of a tree.
- determine problem solutions by systematically searching the
solution space for the given problem instance.
- search is facilitated by using tree organization for solution space.

• after determining that node can lead to nothing but dead end, go back
(backtrack) to nodes parent and proceed with search on next child.

• Backtracking algorithm need not actually create a tree.

- only needs to keep track of values in current branch being
investigated.
- the state space tree exists implicitly in algorithm and is not actually
constructed.

Divyashikha Sethia (DTU)

11-6
 Terminology:

• Problem state each node in depth first search tree.

• Solution states are problem states „S‟ for which the path from
the root node to „S‟ defines a tuple in the solution space.
• Answer states those solution states for which path from root
node to s defines a tuple that is member of set of solutions.
• State space is set of paths from root node to other nodes.
State space tree is the tree organization of the solution space.
The state space trees are called static trees. tree organizations are
independent of the problem instance being solved.
tree organization is determined dynamically as the solution space is
being searched. Tree organizations that are problem instance
dependent are called dynamic trees.

Divyashikha Sethia (DTU)

11-7
 Terminology…
• Live node is a node that has been generated but whose children
have not yet been generated.
• E-node is a live node whose children are currently being
explored. In other words, an E-node is a node currently being
expanded.
• Dead node is a generated node that is not to be expanded or
explored any further. All children of a dead node have already
been expanded.
• Branch and Bound refers to all state space search methods in
which all children of an E-node are generated before any other
live node can become the E-node.
• Depth first node generation with bounding functions is called
backtracking. State generation methods in which the E-node
remains the E-node until it is dead, lead to branch and bound
methods.

Divyashikha Sethia (DTU)

11-8
 N-Queens Problem

• N = 8. Then 8-Queens Problem is to place eight queens on an 8 x

8 chessboard so that no two “attack”, that is, no two of them are
on the same row, column, or diagonal.
• All solutions to the 8-queens problem can be represented as 8-
tuples (x1, . . . . , x8), where xi is the column of the ith row
where the ith queen is placed.
• The explicit constraints using this formulation are Si = {1, 2, 3, 4,
5, 6, 7, 8}, 1 < i < 8. Therefore the solution space consists of 88
8-tuples.
• The implicit constraints for this problem are that no two xi‟s can
be the same (i.e., all queens must be on different columns) and
no two queens can be on the same diagonal.

Divyashikha Sethia (DTU)

11-9
 8 queen problem
• placing eight chess queens
on an 8×8 chessboard so that
no two queens threaten each
other
• Explicit constraints using 8-tuple
formation, for this problem are S= {1, 2,
3, 4, 5, 6, 7, 8}.
• The implicit constraints for this problem
are that no two queens can be the same
(i.e., all queens must be on different
columns) and no two queens can be on
the same diagonal.

Divyashikha Sethia (DTU)

11-10
➢ check whether two queens are in same column or
diagonal:

• Column Conflicts: Two queens conflict if their xi values are identical.

• Diag 45 conflict: Two queens i and j are on same 450 diagonal if:
i – j = k – l. This implies, j – l = i – k
• Diag 135 conflict: i + j = k + l. This implies, j – l = k – I
• two queens lie on the same diagonal if and only if: |j – l} = |i – k|
j be the column of object in row i for the ith queen and l be the column of
object in row „k‟ for the kth queen.

Divyashikha Sethia (DTU)

11-11
 Clashes

• The two queens are attacking. This is not a solution.

Divyashikha Sethia (DTU)

11-12
 8-queens problem example
• feasible sequence 7, 5, 3, 1.
• Step 1:
Add to the sequence the next number in the
sequence 1, 2, . . . , 8 not yet used.
• Step 2:
If this new sequence is feasible and has length
8 then STOP with a solution. If the new
sequence is feasible and has length less then 8,
repeat Step 1.
• Step 3:
If the sequence is not feasible, then backtrack
through the sequence until we find the most
recent place at which we can exchange a value.
Go back to Step 1.

Divyashikha Sethia (DTU)

11-13
 SOLUTION

* indicates conflicting queens.

Divyashikha Sethia (DTU)
11-14
Knapsack using Backtracking

Divyashikha Sethia (DTU)

11-15
 Knapsack Backtracking 0/1

• https://www.youtube.com/watch?v=RruLaBJh6IU
Divyashikha Sethia (DTU)
11-16
• Example

Divyashikha Sethia (DTU)

11-17
Divyashikha Sethia (DTU)
11-18
Divyashikha Sethia (DTU)
11-19
Divyashikha Sethia (DTU)
11-20
 Reference
• https://www.youtube.com/watch?v=DKCbs
iDBN6c&list=PLDN4rrl48XKpZkf03iYFl-
O29szjTrs_O&index=63
• http://www.gpcet.ac.in/wp-
content/uploads/2018/03/DAA-Notes_0-
95-124.pdf
• https://codecrucks.com/knapsack-
problem-using-backtracking/

Divyashikha Sethia (DTU)

11-21
Divyashikha Sethia (DTU)
11-22