Introduction to Backtracking Algorithms

The Backtracking is an algorithmic-technique to solve a problem by an incremental way. It uses recursive approach to solve the problems. We can say that the backtracking is used to find all possible combination to solve an optimization problem.

In this Section We are going to cover

• Hamiltonian Cycle
• M-Coloring Problem
• N Queen Problem
• Rat in Maze Problem
• Cryptarithmetic Puzzle
• Subset Sum Problem
• Sudoku Solving Algorithm
• Knight-Tour Problem
• Tug-Of-War Problem
• Word Break Algorithm
• Maximum number by swapping problem

Karthikeya Boyini

Published on 01-Oct-2018 06:56:27

• Related Questions & Answers
• Introduction to Backtracking
• Introduction to Searching Algorithms
• Introduction to Greedy Algorithms
• Introduction to Graph Algorithms
• Introduction to Pattern Searching Algorithms
• Introduction to Analysis of Algorithms
• Introduction to Divide & Conquer Algorithms
• Introduction to Algorithms for Mathematical Problems
• Introduction to Databases
• What is the difference between Backtracking and Non- Backtracking?
• Introduction to Miscellaneous Problems
• Introduction to Sorting Techniques
• Introduction to Dynamic Programming
• Introduction to Mathematical Logic!
• Rebalancing Algorithms