UnixJunkie
diff --git a/‎backtracking/n_queens.py‎
Lines changed: 84 additions & 0 deletions b/‎backtracking/n_queens.py‎
Lines changed: 84 additions & 0 deletions
diff --git a/‎backtracking/sum_of_subsets.py‎
Lines changed: 45 additions & 0 deletions b/‎backtracking/sum_of_subsets.py‎
Lines changed: 45 additions & 0 deletions
diff --git a/‎other/n_queens.py‎
Lines changed: 0 additions & 77 deletions b/‎other/n_queens.py‎
Lines changed: 0 additions & 77 deletions
@@ -0,0 +1,84 @@
+'''
+
+ The nqueens problem is of placing N queens on a N * N 
+ chess board such that no queen can attack any other queens placed
+ on that chess board.
+ This means that one queen cannot have any other queen on its horizontal, vertical and 
+ diagonal lines.
+
+'''
+solution = []
+
+def isSafe(board, row, column):
+    '''
+    This function returns a boolean value True if it is safe to place a queen there considering 
+    the current state of the board.
+
+    Parameters :
+    board(2D matrix) : board
+    row ,column : coordinates of the cell on a board
+
+    Returns :
+    Boolean Value
+
+    '''
+    for i in range(len(board)):
+        if board[row][i] == 1:
+            return False
+    for i in range(len(board)):
+        if board[i][column] == 1:
+            return False
+    for i,j in zip(range(row,-1,-1),range(column,-1,-1)):
+        if board[i][j] == 1:
+            return False
+    for i,j in zip(range(row,-1,-1),range(column,len(board))):
+        if board[i][j] == 1:
+            return False
+    return True
+
+def solve(board, row):
+    '''
+    It creates a state space tree and calls the safe function untill it receives a 
+    False Boolean and terminates that brach and backtracks to the next 
+    poosible solution branch.
+    '''
+    if row >= len(board):
+        '''
+        If the row number exceeds N we have board with a successful combination 
+        and that combination is appended to the solution list and the board is printed.
+
+        '''
+        solution.append(board)
+        printboard(board)
+        print()
+        return 
+    for i in range(len(board)):
+        '''
+        For every row it iterates through each column to check if it is feesible to place a 
+        queen there.
+        If all the combinations for that particaular branch are successfull the board is 
+        reinitialized for the next possible combination.
+        '''
+        if isSafe(board,row,i):
+            board[row][i] = 1
+            solve(board,row+1)
+            board[row][i] = 0
+    return False
+
+def printboard(board):
+    '''
+    Prints the boards that have a successfull combination.
+    '''
+    for i in range(len(board)):
+        for j in range(len(board)):
+            if board[i][j] == 1:
+                print("Q", end = " ")
+            else :
+                print(".", end = " ")
+        print()
+
+#n=int(input("The no. of queens")) 
+n = 8
+board = [[0 for i in range(n)]for j in range(n)]
+solve(board, 0)
+print("The total no. of solutions are :", len(solution))
@@ -0,0 +1,45 @@
+'''
+	The sum-of-subsetsproblem states that a set of non-negative integers, and a value M, 
+	determine all possible subsets of the given set whose summation sum equal to given M.
+
+	Summation of the chosen numbers must be equal to given number M and one number can 
+	be used only once.
+'''
+
+def generate_sum_of_subsets_soln(nums, max_sum):
+	result = []
+	path = []
+	num_index = 0
+	remaining_nums_sum = sum(nums)
+	create_state_space_tree(nums, max_sum, num_index, path,result, remaining_nums_sum)
+	return result
+
+def create_state_space_tree(nums,max_sum,num_index,path,result, remaining_nums_sum):
+	'''
+	Creates a state space tree to iterate through each branch using DFS.
+	It terminates the branching of a node when any of the two conditions 
+	given below satisfy.
+	This algorithm follows depth-fist-search and backtracks when the node is not branchable.
+
+	'''
+	if sum(path) > max_sum or (remaining_nums_sum + sum(path)) < max_sum:
+		return
+	if sum(path) == max_sum:
+		result.append(path)
+		return
+	for num_index in range(num_index,len(nums)):
+		create_state_space_tree(nums, max_sum, num_index + 1, path + [nums[num_index]], result, remaining_nums_sum - nums[num_index])
+
+'''
+remove the comment to take an input from the user 
+
+print("Enter the elements")
+nums = list(map(int, input().split()))
+print("Enter max_sum sum")
+max_sum = int(input())
+
+'''
+nums = [3, 34, 4, 12, 5, 2]
+max_sum = 9
+result = generate_sum_of_subsets_soln(nums,max_sum)
+print(*result)