# captureAgents.py
# —————-
# Licensing Information: You are free to use or extend these projects for
# educational purposes provided that (1) you do not distribute or publish
# solutions, (2) you retain this notice, and (3) you provide clear
# attribution to UC Berkeley, including a link to http://ai.berkeley.edu.
#
# Attribution Information: The Pacman AI projects were developed at UC Berkeley.
# The core projects and autograders were primarily created by John DeNero
# (denero@cs.berkeley.edu) and Dan Klein (klein@cs.berkeley.edu).
# Student side autograding was added by Brad Miller, Nick Hay, and
# Pieter Abbeel (pabbeel@cs.berkeley.edu).
“””
Interfaces for capture agents and agent factories
“””
from game import Agent
import distanceCalculator
from util import nearestPoint
import util
# Note: the following class is not used, but is kept for backwards
# compatibility with team submissions that try to import it.
class AgentFactory:
“Generates agents for a side”
def __init__(self, isRed, **args):
self.isRed = isRed
def getAgent(self, index):
“Returns the agent for the provided index.”
util.raiseNotDefined()
class RandomAgent( Agent ):
“””
A random agent that abides by the rules.
“””
def __init__( self, index ):
self.index = index
def getAction( self, state ):
return random.choice( state.getLegalActions( self.index ) )
class CaptureAgent(Agent):
“””
A base class for capture agents. The convenience methods herein handle
some of the complications of a two-team game.
Recommended Usage: Subclass CaptureAgent and override chooseAction.
“””
#############################
# Methods to store key info #
#############################
def __init__( self, index, timeForComputing = .1 ):
“””
Lists several variables you can query:
self.index = index for this agent
self.red = true if you’re on the red team, false otherwise
self.agentsOnTeam = a list of agent objects that make up your team
self.distancer = distance calculator (contest code provides this)
self.observationHistory = list of GameState objects that correspond
to the sequential order of states that have occurred so far this game
self.timeForComputing = an amount of time to give each turn for computing maze distances
(part of the provided distance calculator)
“””
# Agent index for querying state
self.index = index
# Whether or not you’re on the red team
self.red = None
# Agent objects controlling you and your teammates
self.agentsOnTeam = None
# Maze distance calculator
self.distancer = None
# A history of observations
self.observationHistory = []
# Time to spend each turn on computing maze distances
self.timeForComputing = timeForComputing
# Access to the graphics
self.display = None
def registerInitialState(self, gameState):
“””
This method handles the initial setup of the
agent to populate useful fields (such as what team
we’re on).
A distanceCalculator instance caches the maze distances
between each pair of positions, so your agents can use:
self.distancer.getDistance(p1, p2)
“””
self.red = gameState.isOnRedTeam(self.index)
self.distancer = distanceCalculator.Distancer(gameState.data.layout)
# comment this out to forgo maze distance computation and use manhattan distances
self.distancer.getMazeDistances()
import __main__
if ‘_display’ in dir(__main__):
self.display = __main__._display
def final(self, gameState):
self.observationHistory = []
def registerTeam(self, agentsOnTeam):
“””
Fills the self.agentsOnTeam field with a list of the
indices of the agents on your team.
“””
self.agentsOnTeam = agentsOnTeam
def observationFunction(self, gameState):
” Changing this won’t affect pacclient.py, but will affect capture.py ”
return gameState.makeObservation(self.index)
def debugDraw(self, cells, color, clear=False):
if self.display:
from captureGraphicsDisplay import PacmanGraphics
if isinstance(self.display, PacmanGraphics):
if not type(cells) is list:
cells = [cells]
self.display.debugDraw(cells, color, clear)
def debugClear(self):
if self.display:
from captureGraphicsDisplay import PacmanGraphics
if isinstance(self.display, PacmanGraphics):
self.display.clearDebug()
#################
# Action Choice #
#################
def getAction(self, gameState):
“””
Calls chooseAction on a grid position, but continues on half positions.
If you subclass CaptureAgent, you shouldn’t need to override this method. It
takes care of appending the current gameState on to your observation history
(so you have a record of the game states of the game) and will call your
choose action method if you’re in a state (rather than halfway through your last
move – this occurs because Pacman agents move half as quickly as ghost agents).
“””
self.observationHistory.append(gameState)
myState = gameState.getAgentState(self.index)
myPos = myState.getPosition()
if myPos != nearestPoint(myPos):
# We’re halfway from one position to the next
return gameState.getLegalActions(self.index)[0]
else:
return self.chooseAction(gameState)
def chooseAction(self, gameState):
“””
Override this method to make a good agent. It should return a legal action within
the time limit (otherwise a random legal action will be chosen for you).
“””
util.raiseNotDefined()
#######################
# Convenience Methods #
#######################
def getFood(self, gameState):
“””
Returns the food you’re meant to eat. This is in the form of a matrix
where m[x][y]=true if there is food you can eat (based on your team) in that square.
“””
if self.red:
return gameState.getBlueFood()
else:
return gameState.getRedFood()
def getFoodYouAreDefending(self, gameState):
“””
Returns the food you’re meant to protect (i.e., that your opponent is
supposed to eat). This is in the form of a matrix where m[x][y]=true if
there is food at (x,y) that your opponent can eat.
“””
if self.red:
return gameState.getRedFood()
else:
return gameState.getBlueFood()
def getCapsules(self, gameState):
if self.red:
return gameState.getBlueCapsules()
else:
return gameState.getRedCapsules()
def getCapsulesYouAreDefending(self, gameState):
if self.red:
return gameState.getRedCapsules()
else:
return gameState.getBlueCapsules()
def getOpponents(self, gameState):
“””
Returns agent indices of your opponents. This is the list of the numbers
of the agents (e.g., red might be “1,3,5”)
“””
if self.red:
return gameState.getBlueTeamIndices()
else:
return gameState.getRedTeamIndices()
def getTeam(self, gameState):
“””
Returns agent indices of your team. This is the list of the numbers
of the agents (e.g., red might be the list of 1,3,5)
“””
if self.red:
return gameState.getRedTeamIndices()
else:
return gameState.getBlueTeamIndices()
def getScore(self, gameState):
“””
Returns how much you are beating the other team by in the form of a number
that is the difference between your score and the opponents score. This number
is negative if you’re losing.
“””
if self.red:
return gameState.getScore()
else:
return gameState.getScore() * -1
def getMazeDistance(self, pos1, pos2):
“””
Returns the distance between two points; These are calculated using the provided
distancer object.
If distancer.getMazeDistances() has been called, then maze distances are available.
Otherwise, this just returns Manhattan distance.
“””
d = self.distancer.getDistance(pos1, pos2)
return d
def getPreviousObservation(self):
“””
Returns the GameState object corresponding to the last state this agent saw
(the observed state of the game last time this agent moved – this may not include
all of your opponent’s agent locations exactly).
“””
if len(self.observationHistory) == 1: return None
else: return self.observationHistory[-2]
def getCurrentObservation(self):
“””
Returns the GameState object corresponding this agent’s current observation
(the observed state of the game – this may not include
all of your opponent’s agent locations exactly).
“””
return self.observationHistory[-1]
def displayDistributionsOverPositions(self, distributions):
“””
Overlays a distribution over positions onto the pacman board that represents
an agent’s beliefs about the positions of each agent.
The arg distributions is a tuple or list of util.Counter objects, where the i’th
Counter has keys that are board positions (x,y) and values that encode the probability
that agent i is at (x,y).
If some elements are None, then they will be ignored. If a Counter is passed to this
function, it will be displayed. This is helpful for figuring out if your agent is doing
inference correctly, and does not affect gameplay.
“””
dists = []
for dist in distributions:
if dist != None:
if not isinstance(dist, util.Counter): raise Exception(“Wrong type of distribution”)
dists.append(dist)
else:
dists.append(util.Counter())
if self.display != None and ‘updateDistributions’ in dir(self.display):
self.display.updateDistributions(dists)
else:
self._distributions = dists # These can be read by pacclient.py
class TimeoutAgent( Agent ):
“””
A random agent that takes too much time. Taking
too much time results in penalties and random moves.
“””
def __init__( self, index ):
self.index = index
def getAction( self, state ):
import random, time
time.sleep(2.0)
return random.choice( state.getLegalActions( self.index ) )