Rajshahi Science and Technology University (RSTU),

Natore.

Algorithms

CSE-213

Course Teacher:

Md Shahidul Islam Shabuz

Lecturer, Department of CSE, RSTU.

Personal Website: https://shahidul-shabuz.github.io/

 BACKTRACKING

Backtracking is an algorithmic technique for solving problems by systematically exploring all

possible decisions and discarding those that lead to unfeasible solutions. It is a recursive
algorithm that builds a solution incrementally, one decision at a time, while constantly checking
for constraints and backtracking if necessary.

Steps in Backtracking

1. Make a decision: Choose one of the available options.

2. Check for constraints: Determine if the chosen decision violates any constraints.
3. If the decision is feasible: Continue building the solution by making another decision.
4. If the decision is not feasible: Backtrack to the previous decision point and try a different
option.
5. Repeat steps 1 to 4 until a solution is found or all possibilities have been exhausted.

Advantages of Backtracking

• Systematic and exhaustive: Backtracking ensures that all possible solutions are
considered, making it a reliable approach for finding all feasible solutions.
• No need for heuristics: Backtracking does not require any heuristics or problem-specific
knowledge, making it a versatile algorithm for a variety of problems.
• Easy to implement: Backtracking is relatively simple to implement, especially in
recursive programming languages.

Disadvantages of Backtracking

• Time and space complexity: Backtracking can be inefficient for problems with a large
number of possible solutions, as it explores all possibilities systematically. This can lead
to high time and space complexity.
• Ineffective for optimization problems: Backtracking is primarily used for finding
feasible solutions, not for finding optimal solutions. For optimization problems, other
algorithms like dynamic programming or greedy algorithms are more appropriate.

Examples of Backtracking

• Maze solving: Backtracking can be used to find a path from the starting point to the goal
in a maze by systematically exploring all possible paths while avoiding walls.
 • Sudoku: Backtracking can be used to solve Sudoku puzzles by filling in the empty cells
with numbers while satisfying the constraints of the puzzle.
• N-queens problem: Backtracking can be used to place N queens on an N x N chessboard
such that no two queens attack each other.

Applications of Backtracking

• Artificial intelligence: Backtracking is a fundamental technique in artificial intelligence,

used in problem solving, planning, and decision making.
• Constraint satisfaction problems: Backtracking is commonly used to solve constraint
satisfaction problems, where the goal is to find a solution that satisfies a set of
constraints.
• Graph algorithms: Backtracking is used in various graph algorithms, such as finding
shortest paths, finding Hamiltonian cycles, and finding minimum spanning trees.

N QUEENS Problem

The N-queens problem is a classic problem in computer science, where the goal is to place N
queens on an N x N chessboard such that no two queens attack each other. Queens attack each
other if they are in the same row, column, or diagonal.

There are many ways to solve the N-queens problem, but one of the most common is
backtracking. Backtracking is an algorithm that systematically explores all possible solutions
to a problem, one decision at a time. In the case of the N-queens problem, the decisions are
where to place the queens on the chessboard.

Here is a step-by-step description of how to solve the N-queens problem using backtracking:

▪ Start with an empty chessboard.

▪ Place the first queen on any empty square.
▪ Recursively place the remaining queens, one at a time, on empty squares that are not
attacked by any of the previously placed queens.
▪ If all N queens can be placed successfully, then the solution has been found.
▪ If no empty square can be found that is not attacked by any of the previously placed
queens, then backtrack to the previous decision point and try a different placement for
the previous queen.
▪ Repeat steps 3-5 until a solution is found or all possibilities have been exhausted.
N - Queens problem is to place n - queens in such a manner on an n x n chessboard that no
queens attack each other by being in the same row, column or diagonal.

It can be seen that for n =1, the problem has a trivial solution, and no solution exists for n =2
and n =3. So first we will consider the 4 queens problem and then generate it to n - queens
problem.

Given a 4 x 4 chessboard and number the rows and column of the chessboard 1 through 4.

Since, we have to place 4 queens such as q1 q2 q3 and q4 on the chessboard, such that no two
queens attack each other. In such a conditional each queen must be placed on a different row,
i.e., we put queen "i" on row "i.".

Now, we place queen q1 in the very first acceptable position (1, 1). Next, we put queen q2 so
that both these queens do not attack each other. We find that if we place q2 in column 1 and 2,
then the dead end is encountered. Thus the first acceptable position for q2 in column 3, i.e. (2,
3) but then no position is left for placing queen 'q3' safely. So we backtrack one step and place
the queen 'q2' in (2, 4), the next best possible solution. Then we obtain the position for placing
'q3' which is (3, 2). But later this position also leads to a dead end, and no place is found where
'q4' can be placed safely. Then we have to backtrack till 'q1' and place it to (1, 2) and then all
other queens are placed safely by moving q2 to (2, 4), q3 to (3, 1) and q4 to (4, 3). That is, we
get the solution (2, 4, 1, 3). This is one possible solution for the 4-queens problem. For another
possible solution, the whole method is repeated for all partial solutions. The other solutions for
4 - queens problems is (3, 1, 4, 2) i.e.
The implicit tree for 4 - queen problem for a solution (2, 4, 1, 3) is as follows:

Fig shows the complete state space for 4 - queens problem. But we can use backtracking method
to generate the necessary node and stop if the next node violates the rule, i.e., if two queens are
attacking.
4 - Queens solution space with nodes numbered in DFS

It can be seen that all the solutions to the 4 queens problem can be represented as 4 - tuples (x1,
x2, x3, x4) where xi represents the column on which queen "qi" is placed.
 Assignment/Home Work
Sub: Algorithms
Sub Code: 213
Marks: 15
1. Sum of Subsets Problem
2. Graph Coloring
3. Hamiltonian Cycles
Follow the following instructions:

1. Write down basic of the problem

2. Gives a appropriate examples
3. Explanations how to solve the problems
4. Application of the problems
5. Advantages and Disadvantages

N.B: You can follow according to N-QUEENS problems above.

Send the pdf of your assignment mshahidul@rstu.edu.bd

Deadline: Softcopy or pdf send to Email: 23 November 2023 at 11.59 PM

Hardcopy: 24 November 2023 during office times.

References:

https://www.javatpoint.com/n-queens-problems