From 4c7ffd80440967df574e0891c3063e6da032fb0d Mon Sep 17 00:00:00 2001
From: Pavel Konovalov <thesnarb@gmail.com>
Date: Tue, 2 May 2017 17:02:14 +0300
Subject: [PATCH] tester works

---
 m3.py | 41 ++++++++++++++++++++++++++++-------------
 1 file changed, 28 insertions(+), 13 deletions(-)

diff --git a/m3.py b/m3.py
index 6edb11e..f19d928 100644
--- a/m3.py
+++ b/m3.py
@@ -9,7 +9,7 @@
 
 class CFRtrainer:
     BETA = 0.00
-    SAMPLE_SIZE = 16 #16 #24
+    SAMPLE_SIZE = 24 #16 #24
 
     def __init__(self):
         self.playerOneTree = GameTree(CfrNode)
@@ -90,26 +90,41 @@ def Train(self):
 
 
 
-#
+# #
 # trainer = CFRtrainer()
 # trainer.Train()
-#
+# #
 # print("Player one avg strategy:")
 # trainer.playerOneTree.PrintAvgStrategy()
-# print("Player one best resp strategy:")
-# trainer.playerOneTree.PrintBestResp()
-# print("Player one regrets:")
-# trainer.playerOneTree.PrintRegrets()
-#
-#
+# # print("Player one best resp strategy:")
+# # trainer.playerOneTree.PrintBestResp()
+# # print("Player one regrets:")
+# # trainer.playerOneTree.PrintRegrets()
+# #
+# #
 # print("----------------------")
 # print("Player two avg strategy:")
 # trainer.playerTwoTree.PrintAvgStrategy()
-# print("Player two best resp strategy:")
-# trainer.playerTwoTree.PrintBestResp()
-# print("Player two regrets:")
-# trainer.playerTwoTree.PrintRegrets()
+# # print("Player two best resp strategy:")
+# # trainer.playerTwoTree.PrintBestResp()
+# # print("Player two regrets:")
+# # trainer.playerTwoTree.PrintRegrets()
+# #
+# #
+# # print("done")
+#
+#
+# if (trainer.kuhn.IsPlayerOneCloseToNash(trainer.playerOneTree)):
+#     print("Player one is in Nash")
+# else:
+#     print("Player one is not in Nash")
+#
+# if(trainer.kuhn.IsPlayerTwoCloseToNash(trainer.playerTwoTree)):
+#     print("Player two is in Nash")
+# else:
+#     print("Player two is not in Nash")
 #
 #
 # print("done")
 #
+#