def isTrapped(mazeMap, mazeWidth, mazeHeight, playerLocation, opponentLocation,
piecesOfCheese) -> (bool, list):
l1 = dj.targetNextCheese(playerLocation, mazeMap, piecesOfCheese,
mazeWidth, mazeHeight)
l2 = dj.targetPoint(opponentLocation, mazeMap, l1[1][0], mazeWidth,
mazeHeight)
if l1[0] > l2[0]:
if len(piecesOfCheese) < 2:
return False, []
cheeseAvailable = [
cheese for cheese in piecesOfCheese if cheese != l1[1][0]
]
ourPath = dj.targetNextCheese(playerLocation, mazeMap, cheeseAvailable,
mazeWidth, mazeHeight)
return l1[0] > l2[0], ourPath[1]
def tryIntercept(mazeMap, mazeWidth, mazeHeight, playerLocation,
opponentLocation, piecesOfCheese) -> (bool, list):
l1 = dj.targetNextCheese(opponentLocation, mazeMap, piecesOfCheese,
mazeWidth, mazeHeight)
l2 = dj.targetPoint(playerLocation, mazeMap, l1[1][0], mazeWidth,
mazeHeight)
return l1[0] > l2[0], l2[1]
def turn(mazeMap, mazeWidth, mazeHeight, playerLocation, opponentLocation,
playerScore, opponentScore, piecesOfCheese, timeAllowed):
global path
global attitude
if path == []:
path.extend(
dj.targetNextCheese(playerLocation, mazeMap, piecesOfCheese,
mazeWidth, mazeHeight)[1])
attitude = "greedy"
interception = tryIntercept(mazeMap, mazeWidth, mazeHeight, playerLocation,
opponentLocation, piecesOfCheese)
if interception[0] and not opponentReacting["defence"]:
path = interception[1]
attitude = "interceptOne"
else:
secondIntercept = tryBestIntercept(mazeMap, mazeWidth, mazeHeight,
playerLocation, opponentLocation,
piecesOfCheese, heatMap)
if secondIntercept[0]:
attitude = "intercept2"
path = secondIntercept[1]
if not isNextCheeseStillHere(path, piecesOfCheese):
path = dj.targetNextCheese(playerLocation, mazeMap, piecesOfCheese,
mazeWidth, mazeHeight)[1]
attitude = "greedy"
test = isTrapped(mazeMap, mazeWidth, mazeHeight, playerLocation,
opponentLocation, piecesOfCheese)
if test:
print("IT'S A TRAP")
attitude = "defence"
path = test[1]
if excpectedOpponentPosition != []:
if excpectedOpponentPosition.pop() != opponentLocation:
print("Opponent reacting to" + attitude)
opponentReacting[attitude] = True
return dj.getDirection(path.pop(), playerLocation)
def tryBestIntercept(mazeMap, mazeWidth, mazeHeight, playerLocation,
opponentLocation, piecesOfCheese,
heatMap) -> (bool, list):
if len(piecesOfCheese) < 2:
return False, []
firstCheese = dj.targetNextCheese(opponentLocation, mazeMap,
piecesOfCheese, mazeWidth, mazeHeight)
cheeseAvailable = [
cheese for cheese in piecesOfCheese if cheese != firstCheese[1][0]
]
ourPath = dj.targetNextCheese(playerLocation, mazeMap, cheeseAvailable,
mazeWidth, mazeHeight)
theirPath = dj.targetNextCheese(opponentLocation, mazeMap, cheeseAvailable,
mazeWidth, mazeHeight)
intercept = trySecondIntercept(mazeMap, mazeWidth, mazeHeight,
playerLocation, opponentLocation,
piecesOfCheese)
heatMapTab = genHeatMap(heatMap, piecesOfCheese)
if 1 / dj.coupleToIndex(heatMapTab, ourPath[1][0]) * (
ourPath[0] < theirPath[0]) > 1 / dj.coupleToIndex(
heatMapTab, intercept[1][0]) * (intercept[0]):
return ourPath[0] < theirPath[0], ourPath[1]
else:
return intercept
def trySecondIntercept(mazeMap, mazeWidth, mazeHeight, playerLocation,
opponentLocation, piecesOfCheese) -> (bool, list):
if len(piecesOfCheese) < 2:
return False, []
firstCheese = dj.targetNextCheese(opponentLocation, mazeMap,
piecesOfCheese, mazeWidth, mazeHeight)
numberOneCheese = getCheeseNumber(firstCheese[1][0])
secondCheese = min([
bt.cheesesPath[numberOneCheese][i] for i in range(len(originalCheese))
if i != numberOneCheese and originalCheese[i] in piecesOfCheese
],
key=lambda couple: couple[0])
ourPath = dj.targetPoint(playerLocation, mazeMap, secondCheese[1][0],
mazeWidth, mazeHeight)
return ourPath[0] < firstCheese[0] + secondCheese[0], ourPath[1]
def turn(mazeMap, mazeWidth, mazeHeight, playerLocation, opponentLocation, playerScore, opponentScore, piecesOfCheese, timeAllowed):
global index
global path
l1 = dj.targetNextCheese(
opponentLocation, mazeMap, piecesOfCheese, mazeWidth, mazeHeight)
l2 = dj.targetPoint(playerLocation, mazeMap,
l1[1][0], mazeWidth, mazeHeight)
if l1[0] > l2[0]:
path = []
path.extend(l2[1])
index = order.index(originalCheese.index(path[0]))
if path == []:
lastIndex = index
index += 1
if index < len(order) and originalCheese[order[index]] not in piecesOfCheese:
i = 1
bestIndex = 0
cheesesRemaining = [x for x in range(
len(originalCheese)) if originalCheese[x] in piecesOfCheese]
bestWeight = bt.cheesesPath[order[lastIndex]
][cheesesRemaining[0]][0]
while i < len(cheesesRemaining):
if bt.cheesesPath[order[lastIndex]][cheesesRemaining[i]][0] < bestWeight:
bestIndex = i
bestWeight = bt.cheesesPath[order[lastIndex]
][cheesesRemaining[i]][0]
i += 1
p = bt.cheesesPath[order[lastIndex]
][cheesesRemaining[bestIndex]][1]
index = order.index(cheesesRemaining[bestIndex])
path.extend(p)
elif index >= len(order):
path.extend(bt.greedIsFeed(playerLocation,
originalCheese, [originalCheese.index(x) for x in piecesOfCheese if x in originalCheese])[1])
else:
path.extend(bt.cheesesPath[order[lastIndex]
][order[index]][1])
return dj.getDirection(path.pop(), playerLocation)