Fix simple min-max algorithm

generation of possible moves used wrong argument
compare with implementation of alpha-beta-pruning

was already part of PR rishal-hurbans#9 but not taken over

Author: fotto

ch03-intelligent_search/adversarial_search/connect_ai.py

@@ -38,7 +38,7 @@ def minmax(connect, depth, min_or_max, move):
     best_score = INFINITY_NEGATIVE * min_or_max
     best_max_move = -1
     # Get possible moves given the board size
-    moves = random.sample(range(0, connect.board_size_y + 1), connect.board_size_x)
+    moves = random.sample(range(0, connect.board_size_x), connect.board_size_x)
     # Try each move
     for slot in moves:
         neighbor = copy.deepcopy(connect)

ch03-intelligent_search/adversarial_search/connect_puzzle_game.py

@@ -7,6 +7,7 @@
 while connect.has_winner() == 0:
     connect.print_turn()
     connect.play_move(caiab.choose_move(connect, SEARCH_DEPTH))
+    #connect.play_move(cai.choose_move(connect, SEARCH_DEPTH))
     connect.print_board()
     print(connect.has_winner())
 

ch03-intelligent_search/adversarial_search/connect_puzzle_test.py

@@ -1,4 +1,5 @@
 import connect_ai_alpha_beta_pruning as caab
+import connect_ai as cai
 import connect_puzzle as cp
 
 # Initialize a Connect game with default board size
@@ -47,6 +48,7 @@
 print(connect.get_score_for_ai())
 
 chosen_move = caab.choose_move(connect, 100)
+#chosen_move = cai.choose_move(connect, 100)
 print('MOVE: ', chosen_move)
 connect.play_move(chosen_move)
 print(connect.get_score_for_ai())