55 Commits

Author	SHA1	Message	Date
Aditi Agarwal	4ff2a9dd4e	minimax (#947) ... * minimax.py minimax algorithm is used for game like tic tac toe. It traces the path and selects the optimal move. * minimax.py Minimax is used in decision making and game theory to find the optimal move for a player, when your opponent also plays optimally. It is widely used in games like Tic-Tac-Toe, Chess. * Delete minimax.py * Update minimax.py * Minimax is a backtracking algorithm that is used in game theory to find the optimal move for a player, assuming that your opponent also plays optimally	2019-07-07 06:59:58 +02:00
Erfan Alimohammadi	69bed59036	Fix backtrack time complexity (#965) ... * Update backtracking/all_permutations.py	2019-07-06 20:01:52 +04:30
Erfan Alimohammadi	839160f83a	Generate all permutations of a sequence, using backtracking (#962) ... * Fix typo * Add all_permutations algorithm to backtracking directory	2019-07-06 16:19:36 +03:00
Erfan Alimohammadi	cc4cf3ece7	Generate all subsequences using backtracking (#961) ... * Add all_subsequences to backtracking directory	2019-07-06 17:43:50 +04:30
Hetal Kuvadia	831558d38d	#945 Backtracking Algorithms (#953) ... * Adding nqueens.py for backtracking * Adding sum_of_subsets.py for backtracking * Update nqueens.py * Rename nqueens.py to n_queens.py * Deleting /other/n_queens.py	2019-07-05 14:18:36 +05:30