config.py

"""
NAME: Naveen Venkat
ID: 2015A7PS0078P
"""

# ========
# SETTINGS
# ========

verbose = False
neat = True
gui = True
suppressGuiClicks = True

guiWidth = 800
guiHeight = 600

cellSize = 60
circleRadius = 20

publishPreCalculatedValues = True

# ================
# GLOBAL VARIABLES
# ================

maxint = float('inf')
minint = float('-inf')
maxplayer = 1
minplayer = -1
alphaBetaGame = 10
miniMaxGame = 11
initial = 0

minimaxAgentTime = 0
alphaBetaAgentTime = 0

tempStackSize = 0
maxStackSize = 0

guiAction = None
guiWinner = None

state = [ [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0], 0 ]
gameRunning = None

triplets = [ [0,1,2], [1,2,3], [4,5,6], [5,6,7], [8,9,10], [9,10,11], [0,5,10], [1,6,11], [3,6,9], [2,5,8], [0,4,8], [1,5,9], [2,6,10], [3,7,11], [12,13,14], [13,14,15], [4,8,12], [5,9,13], [6,10,14], [7,11,15], [4,9,14], [5,10,15], [6,9,12], [7,10,13] ]

abT1 = 0
abT2 = 0
mmT1 = 0
mmT2 = 0

# Minimax based analysis
R1 = "Not Played" # number of nodes generated till the problem is solved
R2 = "Not Played" # amount of memory allocated to one node
R3 = "Not Played" # the maximum growth of the implicit stack
R4 = "Not Played" # the total time to play the game
R5 = "Not Played" # the number of nodes created in one micro second

# Alpha Beta pruning based analysis
R6 = "Not Played" # the number of nodes generated till the problem is solved
R7 = "Not Played" # (R1 - R6)/R1 : saving using pruning
R8 = "Not Played" # the total time to play a game

# Comparative analysis
R9 = 0 # the memory used in both the techniques (Minimax and Alpha Beta pruning)
R10 = 0 # average time to play the game ( 10 times )
R11 = 0 # the number of times player M wins
R12 = "40 times in 4 sets of 10 games" # average number of times player M wins ( repeating the step in R10 for 20 times)