# Set boardValues
for i in range(boardSize):
line = f.readline().rstrip()
line = line.split(" ")
for j in range(boardSize):
boardValues[i][j] = int(line[j])
# Set boardState
for i in range(boardSize):
line = f.readline().rstrip()
for j in range(boardSize):
originBoardState[i][j] = line[j]
f.close()
if algo == "MINIMAX":
result = minimax.Minimax_Decision(originBoardState)
f = open("output.txt", "w")
chars = ['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', \
'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z']
if result[1] == True:
actionType = "Stake"
else:
actionType = "Raid"
resultIndex = chars[result[0] % boardSize] + str(int(result[0]/boardSize) + 1)
f.write(resultIndex+ " " + actionType + "\n")
for i in range(boardSize):
f.write("".join(result[2][i])+"\n")
f.close()
if algo == "ALPHABETA":
result = alphabeta.ABSearch(originBoardState)
