Welcome To Tutorialspoint.dev
Officially launched 18th May 2019

# The Knight’s tour problem Backtracking-1

Backtracking is an algorithmic paradigm that tries different solutions until finds a solution that &#x201C;works&#x201D;. Problems which are typically solved using ba...

# Subset Sum Backtracking-4

Subset sum problem is to find subset of elements that are selected from a given set&#xA0;whose sum adds up to a given number K. We are considering the set contains no...

# Rat in a Maze Backtracking-2

We have discussed Backtracking and Knight&#x2019;s tour problem in Set 1. Let us discuss Rat in a Maze as another example problem that can be solved using Backtracki...

# m Coloring Problem Backtracking-5

Given an undirected graph and a number m, determine if the graph can be colored with at most m colors such that no two adjacent vertices of the graph are colored with...

# N Queen Problem Backtracking-3

We have discussed Knight&#x2019;s tour and Rat in a Maze problems in Set 1 and Set 2 respectively. Let us discuss N Queen as another example problem that can be solv...

# Sudoku Backtracking-7

Given a partially filled 9&#xD7;9 2D array &#x2018;grid&#x2019;, the goal is to assign digits (from 1 to 9) to the empty cells so that every row, column, and s...

# Hamiltonian Cycle Backtracking-6

Hamiltonian Path in an undirected graph is a path that visits each vertex exactly once. A Hamiltonian cycle (or Hamiltonian circuit) is a Hamiltonian Path such that t...