From db773689a72d7fb3325a289174a7ab11031a96bd Mon Sep 17 00:00:00 2001
From: Aditi Agarwal <31546143+aditiagarwal34550@users.noreply.github.com>
Date: Sun, 7 Jul 2019 08:35:19 +0530
Subject: [PATCH] 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

---
 backtracking/minimax.py | 28 ++++++++++++++++++++++++++++
 minimax.py              | 26 --------------------------
 2 files changed, 28 insertions(+), 26 deletions(-)
 create mode 100644 backtracking/minimax.py
 delete mode 100644 minimax.py

diff --git a/backtracking/minimax.py b/backtracking/minimax.py
new file mode 100644
index 000000000000..5168306e71fc
--- /dev/null
+++ b/backtracking/minimax.py
@@ -0,0 +1,28 @@
+import math 
+
+''' Minimax helps to achieve maximum score in a game by checking all possible moves
+    depth is current depth in game tree. 
+    nodeIndex is index of current node in scores[].
+    if move is of maximizer return true else false
+    leaves of game tree is stored in scores[]  
+    height is maximum height of Game tree
+'''
+
+def minimax (Depth, nodeIndex, isMax, scores, height):  
+
+    if Depth == height:  
+        return scores[nodeIndex] 
+
+    if isMax: 
+        return (max(minimax(Depth + 1, nodeIndex * 2, False, scores, height),
+                    minimax(Depth + 1, nodeIndex * 2 + 1, False, scores, height))) 
+    return (min(minimax(Depth + 1, nodeIndex * 2, True, scores, height), 
+               minimax(Depth + 1, nodeIndex * 2 + 1, True, scores, height))) 
+
+if __name__ == "__main__": 
+ 
+    scores = [90, 23, 6, 33, 21, 65, 123, 34423] 
+    height = math.log(len(scores), 2) 
+
+    print("Optimal value : ", end = "") 
+    print(minimax(0, 0, True, scores, height)) 
diff --git a/minimax.py b/minimax.py
deleted file mode 100644
index 51231b2aacde..000000000000
--- a/minimax.py
+++ /dev/null
@@ -1,26 +0,0 @@
-import math 
-
-''' Minimax helps to achieve maximum score in a game by checking all possible moves
-    depth is current depth in game tree. 
-    nodeIndex is index of current node in scores[].
-    if move is of maximizer return true else false
-    leaves of game tree is stored in scores[]  
-    height is maximum height of Game tree
-'''
-
-def minimax (Depth, nodeIndex, isMax, scores, height):  
-
-    if (Depth == height):  
-        return scores[nodeIndex] 
-
-    if (isMax): 
-        return max(minimax(Depth + 1, nodeIndex * 2, False, scores, height), minimax(Depth + 1, nodeIndex * 2 + 1, False, scores, height)) 
-    return min(minimax(Depth + 1, nodeIndex * 2, True, scores, height), minimax(Depth + 1, nodeIndex * 2 + 1, True, scores, height)) 
-
-
-scores = [90, 23, 6, 33, 21, 65, 123, 34423] 
-
-height = math.log(len(scores), 2) 
-
-print("Optimal value : ", end = "") 
-print(minimax(0, 0, True, scores, height))