ó ªÁWc@s†dZddlmZddlmZddlmZddlZddlZddlZdefd„ƒYZdefd „ƒYZ d ej fd „ƒYZ d e fd „ƒYZ de fd„ƒYZ id„Zid„Zdej fd„ƒYZd„Zde fd„ƒYZdd!d„ƒYZde fd„ƒYZd„Zde fd„ƒYZde fd„ƒYZd „ZdS("s¬ This file contains all of the agents that can be selected to control Pacman. To select an agent, use the '-p' option when running pacman.py. Arguments can be passed to your agent using '-a'. For example, to load a SearchAgent that uses depth first search (dfs), run the following command: > python pacman.py -p SearchAgent -a fn=depthFirstSearch Commands to invoke other search strategies can be found in the project description. Please only change the parts of the file you are asked to. Look for the lines that say "*** YOUR CODE HERE ***" The parts you fill in start about 3/4 of the way down. Follow the project description for details. Good luck and happy searching! iÿÿÿÿ(t Directions(tAgent(tActionsNt GoWestAgentcBseZdZd„ZRS(s'An agent that goes West until it can't.cCs'tj|jƒkrtjStjSdS(s6The agent receives a GameState (defined in pacman.py).N(RtWESTtgetLegalPacmanActionstSTOP(tselftstate((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyt getAction/s(t__name__t __module__t__doc__R (((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyR,st SearchAgentcBs2eZdZdddd„Zd„Zd„ZRS(sš This very general search agent finds a path using a supplied search algorithm for a supplied search problem, then returns actions to follow that path. As a default, this agent runs DFS on a PositionSearchProblem to find location (1,1) Options for fn include: depthFirstSearch or dfs breadthFirstSearch or bfs Note: You should NOT change any code in SearchAgent tdepthFirstSearchtPositionSearchProblemt nullHeuristiccs$|ttƒkr"t|d‚ntt|ƒ‰dˆjjkrXd|GHˆ|_nz|tƒjƒkr}tƒ|‰n1|ttƒkr¡tt|ƒ‰n t|d‚d||fGH‡‡fd†|_|tƒjƒks÷|j dƒ rt|d‚ntƒ||_ d |GHdS( Ns' is not a search function in search.py.t heuristics[SearchAgent] using function s3 is not a function in searchAgents.py or search.py.s0[SearchAgent] using function %s and heuristic %scsˆ|dˆƒS(NR((tx(tfunctheur(sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyt_stProblems1 is not a search problem type in SearchAgents.py.s![SearchAgent] using problem type ( tdirtsearchtAttributeErrortgetattrt func_codet co_varnamestsearchFunctiontglobalstkeystendswitht searchType(RtfntprobR((RRsM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyt__init__Ls"   %cCs˜|jdkrtd‚ntjƒ}|j|ƒ}|j|ƒ|_|j|jƒ}d|tjƒ|fGHdt|ƒkr”d|jGHndS(sL This is the first time that the agent sees the layout of the game board. Here, we choose a path to the goal. In this phase, the agent should compute the path to the goal and store it in a local variable. All of the work is done in this method! state: a GameState object (pacman.py) s+No search function provided for SearchAgents0Path found with total cost of %d in %.1f secondst _expandedsSearch nodes expanded: %dN( RtNonet ExceptionttimeR!tactionstgetCostOfActionsRR%(RRt starttimetproblemt totalCost((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pytregisterInitialStategs   cCsadt|ƒkrd|_n|j}|jd7_|t|jƒkrV|j|StjSdS(sÝ Returns the next action in the path chosen earlier (in registerInitialState). Return Directions.STOP if there is no further action to take. state: a GameState object (pacman.py) t actionIndexiiN(RR/tlenR)RR(RRti((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyR xs   (R R R R$R.R (((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyR ;s RcBsMeZdZd„dd eed„Zd„Zd„Zd„Zd„Z RS( sc A search problem defines the state space, start state, goal test, successor function and cost function. This search problem can be used to find paths to a particular point on the pacman board. The state space consists of (x,y) positions in a pacman game. Note: this search problem is fully specified; you should NOT change it. cCsdS(Ni((R((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyR“sicCs¢|jƒ|_|jƒ|_|dkr6||_n||_||_||_|r|jƒdksy|j |Œ rdGHnigd|_ |_ |_ dS(sÙ Stores the start and goal. gameState: A GameState object (pacman.py) costFn: A function from a search state (tuple) to a non-negative number goal: A position in the gameState is6Warning: this does not look like a regular search mazeiN( tgetWallstwallstgetPacmanPositiont startStateR&tgoaltcostFnt visualizet getNumFoodthasFoodt_visitedt _visitedlistR%(Rt gameStateR7R6tstarttwarnR8((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyR$“s    (cCs|jS(N(R5(R((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyt getStartState§scCs||jk}|r}|jr}|jj|ƒddl}dt|ƒkr}dt|jƒkrz|jj|jƒqzq}n|S(Niÿÿÿÿt_displaytdrawExpandedCells(R6R8R<tappendt__main__RRARB(RRtisGoalRD((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyt isGoalStateªs c Csøg}x­tjtjtjtjgD]}|\}}tj|ƒ\}}t||ƒt||ƒ}} |j|| s%|| f} |j | ƒ} |j | || fƒq%q%W|j d7_ ||j krôt |j |<|jj |ƒn|S(s« Returns successor states, the actions they require, and a cost of 1. As noted in search.py: For a given state, this should return a list of triples, (successor, action, stepCost), where 'successor' is a successor to the current state, 'action' is the action required to get there, and 'stepCost' is the incremental cost of expanding to that successor i(RtNORTHtSOUTHtEASTRRtdirectionToVectortintR3R7RCR%R;tTrueR<( RRt successorstactionRtytdxtdytnextxtnextyt nextStatetcost((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyt getSuccessors·s % !  cCs¡|dkrdS|jƒ\}}d}xr|D]j}tj|ƒ\}}t||ƒt||ƒ}}|j||r€dS||j||fƒ7}q/W|S(sˆ Returns the cost of a particular sequence of actions. If those actions include an illegal move, return 999999. i?BiN(R&R@RRJRKR3R7(RR)RRORURNRPRQ((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyR*Õs  !(iiN( R R R R&RLR$R@RFRVR*(((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyRˆs    tStayEastSearchAgentcBseZdZd„ZRS(sÄ An agent for position search with a cost function that penalizes being in positions on the West side of the board. The cost function for stepping into a position (x,y) is 1/2^x. cs+tj|_d„‰‡fd†|_dS(NcSs d|dS(Ngà?i((tpos((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyRîscst|ˆddtƒS(Ni(ii(RR&tFalse(R(R7(sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyRïs(RtuniformCostSearchRR!(R((R7sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyR$ìs  (R R R R$(((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyRWåstStayWestSearchAgentcBseZdZd„ZRS(s An agent for position search with a cost function that penalizes being in positions on the East side of the board. The cost function for stepping into a position (x,y) is 2^x. cs+tj|_d„‰‡fd†|_dS(NcSs d|dS(Nii((RX((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyRúscs t|ˆƒS(N(R(R(R7(sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyRûs(RRZRR!(R((R7sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyR$øs  (R R R R$(((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyR[ñscCs;|}|j}t|d|dƒt|d|dƒS(s<The Manhattan distance heuristic for a PositionSearchProblemii(R6tabs(tpositionR,tinfotxy1txy2((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pytmanhattanHeuristicýs cCs;|}|j}|d|dd|d|dddS(s<The Euclidean distance heuristic for a PositionSearchProblemiiigà?(R6(R]R,R^R_R`((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyteuclideanHeuristics tCornersProblemcBs;eZdZd„Zd„Zd„Zd„Zd„ZRS(s’ This search problem finds paths through all four corners of a layout. You must select a suitable state space and successor function cCs¨|jƒ|_|jƒ|_|jjd|jjd}}dd|f|df||ff|_x2|jD]'}|j|Œspdt|ƒGHqpqpWd|_ dS(sK Stores the walls, pacman's starting position and corners. iisWarning: no food in corner iN(ii( R2R3R4tstartingPositiontheighttwidthtcornersR:tstrR%(RtstartingGameStatettoptrighttcorner((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyR$s!' cCstjƒdS(sh Returns the start state (in your state space, not the full Pacman state space) N(tutiltraiseNotDefined(R((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyR@$scCstjƒdS(sS Returns whether this search state is a goal state of the problem. N(RmRn(RR((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyRF,scCsBg}x&tjtjtjtjgD]}q%W|jd7_|S(sª Returns successor states, the actions they require, and a cost of 1. As noted in search.py: For a given state, this should return a list of triples, (successor, action, stepCost), where 'successor' is a successor to the current state, 'action' is the action required to get there, and 'stepCost' is the incremental cost of expanding to that successor i(RRGRHRIRR%(RRRMRN((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyRV3s %cCs…|dkrdS|j\}}xY|D]Q}tj|ƒ\}}t||ƒt||ƒ}}|j||r&dSq&Wt|ƒS(s§ Returns the cost of a particular sequence of actions. If those actions include an illegal move, return 999999. This is implemented for you. i?BN(R&RdRRJRKR3R0(RR)RRORNRPRQ((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyR*Ls  !(R R R R$R@RFRVR*(((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyRc s     cCs|j}|j}dS(s« A heuristic for the CornersProblem that you defined. state: The current search state (a data structure you chose in your search problem) problem: The CornersProblem instance for this layout. This function should always return a number that is a lower bound on the shortest path from the state to a goal of the problem; i.e. it should be admissible (as well as consistent). i(RgR3(RR,RgR3((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pytcornersHeuristicZs  tAStarCornersAgentcBseZdZd„ZRS(sCA SearchAgent for FoodSearchProblem using A* and your foodHeuristiccCsd„|_t|_dS(NcSstj|tƒS(N(Rt aStarSearchRo(R#((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyRps(RRcR!(R((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyR$os (R R R R$(((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyRpmstFoodSearchProblemcBs;eZdZd„Zd„Zd„Zd„Zd„ZRS(su A search problem associated with finding the a path that collects all of the food (dots) in a Pacman game. A search state in this problem is a tuple ( pacmanPosition, foodGrid ) where pacmanPosition: a tuple (x,y) of integers specifying Pacman's position foodGrid: a Grid (see game.py) of either True or False, specifying remaining food cCsI|jƒ|jƒf|_|jƒ|_||_d|_i|_dS(Ni(R4tgetFoodR>R2R3RiR%t heuristicInfo(RRi((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyR$|s   cCs|jS(N(R>(R((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyR@ƒscCs|djƒdkS(Nii(tcount(RR((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyRF†sc CsÜg}|jd7_xÀtjtjtjtjgD] }|d\}}tj|ƒ\}}t||ƒt||ƒ}} |j || s4|dj ƒ} t | || <|j || f| f|dfƒq4q4W|S(sDReturns successor states, the actions they require, and a cost of 1.ii( R%RRGRHRIRRRJRKR3tcopyRYRC( RRRMt directionRRORPRQRRRStnextFood((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyRV‰s%!)cCs†|jƒd\}}d}xc|D][}tj|ƒ\}}t||ƒt||ƒ}}|j||rtdS|d7}q#W|S(svReturns the cost of a particular sequence of actions. If those actions include an illegal move, return 999999ii?Bi(R@RRJRKR3(RR)RRORURNRPRQ((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyR*—s !(R R R R$R@RFRVR*(((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyRrss     tAStarFoodSearchAgentcBseZdZd„ZRS(sCA SearchAgent for FoodSearchProblem using A* and your foodHeuristiccCsd„|_t|_dS(NcSstj|tƒS(N(RRqt foodHeuristic(R#((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyR¨s(RRrR!(R((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyR$§s (R R R R$(((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyRy¥scCs|\}}dS(sò Your heuristic for the FoodSearchProblem goes here. This heuristic must be consistent to ensure correctness. First, try to come up with an admissible heuristic; almost all admissible heuristics will be consistent as well. If using A* ever finds a solution that is worse uniform cost search finds, your heuristic is *not* consistent, and probably not admissible! On the other hand, inadmissible or inconsistent heuristics may find optimal solutions, so be careful. The state is a tuple ( pacmanPosition, foodGrid ) where foodGrid is a Grid (see game.py) of either True or False. You can call foodGrid.asList() to get a list of food coordinates instead. If you want access to info like walls, capsules, etc., you can query the problem. For example, problem.walls gives you a Grid of where the walls are. If you want to *store* information to be reused in other calls to the heuristic, there is a dictionary called problem.heuristicInfo that you can use. For example, if you only want to count the walls once and store that value, try: problem.heuristicInfo['wallCount'] = problem.walls.count() Subsequent calls to this heuristic can access problem.heuristicInfo['wallCount'] i((RR,R]tfoodGrid((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyRz«s tClosestDotSearchAgentcBs eZdZd„Zd„ZRS(s0Search for all food using a sequence of searchescCsÎg|_|}x|jƒjƒdkr®|j|ƒ}|j|7_x`|D]X}|jƒ}||kr•t|ƒt|ƒf}td|‚n|jd|ƒ}qOWqWd|_dt |jƒGHdS(Nis5findPathToClosestDot returned an illegal move: %s! %ssPath found with cost %d.( R)RsRutfindPathToClosestDottgetLegalActionsRhR'tgenerateSuccessorR/R0(RRt currentStatetnextPathSegmentRNtlegaltt((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyR.Ís     cCs>|jƒ}|jƒ}|jƒ}t|ƒ}tjƒdS(si Returns a path (a list of actions) to the closest dot, starting from gameState. N(R4RsR2tAnyFoodSearchProblemRmRn(RR=t startPositiontfoodR3R,((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyR}Üs     (R R R R.R}(((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyR|Ës R„cBs eZdZd„Zd„ZRS(sé A search problem for finding a path to any food. This search problem is just like the PositionSearchProblem, but has a different goal test, which you need to fill in below. The state space and successor function do not need to be changed. The class definition above, AnyFoodSearchProblem(PositionSearchProblem), inherits the methods of the PositionSearchProblem. You can use this search problem to help you fill in the findPathToClosestDot method. cCsZ|jƒ|_|jƒ|_|jƒ|_d„|_igd|_|_|_ dS(sFStores information from the gameState. You don't need to change this.cSsdS(Ni((R((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyRsiN( RsR†R2R3R4R5R7R;R<R%(RR=((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyR$ùs  cCs|\}}tjƒdS(s‚ The state is Pacman's position. Fill this in with a goal test that will complete the problem definition. N(RmRn(RRRRO((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyRFs (R R R R$RF(((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyR„ês  c Cs¥|\}}|\}}|jƒ}||| sItdt|ƒƒ‚||| sntdt|ƒƒ‚t|d|d|dtdtƒ}ttj|ƒƒS(sQ Returns the maze distance between any two points, using the search functions you have already built. The gameState can be any game state -- Pacman's position in that state is ignored. Example usage: mazeDistance( (2,4), (5,6), gameState) This might be a useful helper function for your ApproximateSearchAgent. spoint1 is a wall: spoint2 is a wall: R>R6R?R8(R2tAssertionErrorRhRRYR0Rtbfs( tpoint1tpoint2R=tx1ty1tx2ty2R3R#((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyt mazeDistances   %%$((R tgameRRRRmR(RRR t SearchProblemRRWR[RaRbRcRoRpRrRyRzR|R„R(((sM/Users/saia/public_html/classes/527-s18/proj/proj1/old/search/searchAgents.pyt#s,   M]   M 2 $