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

..

all_permutations.py

Fix backtrack time complexity (#965)

2019-07-06 20:01:52 +04:30

all_subsequences.py

Generate all subsequences using backtracking (#961)

2019-07-06 17:43:50 +04:30

minimax.py

minimax (#947)

2019-07-07 06:59:58 +02:00

n_queens.py

#945 Backtracking Algorithms (#953)

2019-07-05 14:18:36 +05:30

sum_of_subsets.py

#945 Backtracking Algorithms (#953)

2019-07-05 14:18:36 +05:30