Backtracking Set 4 (Subset Sum) – Backtracking – Subset sum problem is to find subset of elements that are selected from a given set whose sum adds up.
8 queens problem
3 Articles
3
C Programming-Backtracking Set 3 (N Queen Problem) – Backtracking – We have discussed Knightâ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 solved using Backtracking.
JAVA Programming-Backtracking Set 3 (N Queen Problem) – JAVA – discuss N Queen as another example problem that can be solved using Backtracking.