CSE 473 Project 1: The Searchin' Pac-Man (100 points, Due Thu Oct 11 before midnight)
Pac-man's got them searchin' blues
Searchin' for dots when there ain't no clues
Introduction
In this project, your Pac-Man agent will find paths through its maze world, both to reach a particular location and to collect food efficiently. You will build general search algorithms and apply them to Pac-Man scenarios.
Clone of the mythical PacMan for Mac OS X. A Mac version of the classic arcade game emulator. A Playstation emulator for Mac. SuperTuxKart Development Team. Kart racing starring Tux. Funny mini car races with reminiscences of TrackMania. Clone of the mythical PacMan for Mac OS X. The Apple digital video game store. Feel the power of a massive gaming experience. Deluxe PocMon is here for your Mac, and coming with it are a few new twists to the pill eaters adventures.This is a remake of my old Amiga classic - Deluxe PacMan, voted in on the Top 100 amiga games of all time.
Pac-Man is compatible with any iPhone and iPod touch running the iPhone 2.0 software update. Peter Cohen is a Macworld senior editor and Game Room columnist.
This is a somewhat long project with several components, so start early!The code for this project consists of several Python files, some of which you will need to read and understand in order to complete the assignment, and some of which you can ignore. You can download all the code and supporting files (including this description) as a zip archive.Files you'll edit: | |
search.py | Where all of your search algorithms will reside. |
searchAgents.py | Where all of your search-based agents will reside. |
Files you might want to look at: | |
pacman.py | The main file that runs Pac-Man games. This file describes a Pac-Man GameState type, which you use in this project. |
game.py | The logic behind how the Pac-Man world works. This file describes several supporting types like AgentState, Agent, Direction, and Grid. |
util.py | Useful data structures for implementing search algorithms. |
Supporting files you can ignore: | |
graphicsDisplay.py | Graphics for Pac-Man |
graphicsUtils.py | Support for Pac-Man graphics |
textDisplay.py | ASCII graphics for Pac-Man |
ghostAgents.py | Agents to control ghosts |
keyboardAgents.py | Keyboard interfaces to control Pac-Man |
layout.py | Code for reading layout files and storing their contents |
What to submit: You will fill in portions of
search.py
and searchAgents.py
during the assignment. You should submit these two files (only) to the CSE 473 Dropbox. Evaluation: Your code will be autograded for technicalcorrectness. Please do not change the names of any provided functions or classes within the code, or you will wreak havoc on the autograder. However, the correctness of your implementation -- not the autograder's output -- will be the final judge of your score. If necessary, we will review and grade assignments individually to ensure that you receive due credit for your work.
Academic Dishonesty: We will be checking your code against other submissions in the class for logical redundancy. We trust you all to submit your own work only; please don't let us down. If you do, we will pursue the strongest consequences available to us.
Getting Help: You are not alone! Feel free to use the class discussion board to discuss or get clarifications on homework-related issues. If you find yourself stuck on something, go to office hours or email the course staff for help. If you can't make our office hours, let us know and we will schedule more. We want these projects to be rewarding and instructional, not frustrating and demoralizing. But, we don't know when or how to help unless you ask. One more piece of advice: if you don't know what a variable does or what kind of values it takes, print it out.
Welcome to Pac-Man
After downloading the code (search.zip), unzipping it and changing to the search directory, you should be able to play a game of Pac-Man by typing the following at the command line:Note: Make sure you are running a recent version of Python (2.5 or later). If you get error messages regarding python-tk, use your package manager to install python-tk, or see this page for more detailed instructions.Pac-Man lives in a shiny blue world of twisting corridors and tasty round treats. Navigating this world efficiently will be Pac-Man's first step in mastering its domain.
The simplest agent in searchAgents.py is called the
GoWestAgent
, which always goes West (a trivial reflex agent). This agent can occasionally win:But, things get ugly for this agent when turning is required:If pacman gets stuck, you can exit the game by typing CTRL-c into your terminal.Soon, your agent will solve not only tinyMaze
, but any maze you want.Note that pacman.py
supports a number of options that can each be expressed in a long way (e.g., --layout
) or a short way (e.g., -l
). You can see the list of all options and their default values via:Also, all of the commands that appear in this project also appear in commands.txt, for easy copying and pasting. In UNIX/Mac OS X, you can even run all these commands in order with bash commands.txt
.Finding a Fixed Food Dot using Search Algorithms
InsearchAgents.py
, you'll find a fully implemented SearchAgent
, which plans out a path through Pac-Man's world and then executes that path step-by-step. The search algorithms for formulating a plan are not implemented -- that's your job. As you work through the following questions, you might need to refer to this glossary of objects in the code.First, test that the SearchAgent
is working correctly by running:The command above tells the SearchAgent
to use tinyMazeSearch
as its search algorithm, which is implemented in search.py
. Pac-Man should navigate the maze successfully.Now it's time to write full-fledged generic search functions to help Pac-Man plan routes! Pseudocode for the search algorithms you'll write can be found in the lecture slides and textbook. Remember that a search node must contain not only a state but also the information necessary to reconstruct the path (plan) which gets to that state.
Important note: All of your search functions need to return a list of actions that will lead the agent from the start to the goal. These actions all have to be legal moves (valid directions, no moving through walls).
Hint: Each algorithm is very similar. Algorithms for DFS, BFS, UCS, and A* differ only in the details of how the fringe is managed. So, concentrate on getting DFS right and the rest should be relatively straightforward. Indeed, one possible implementation is to use only a single generic search method which is configured with an algorithm-specific queuing strategy. (Your implementation need not be of this form to receive full credit).
Hint: Make sure to check out the
Stack, Queue
and PriorityQueue
types provided to you in util.py
! Question 1 (10 points) Implement the depth-first search (DFS) algorithm in the
depthFirstSearch
function in search.py
. To make your algorithm complete, write the graph search version of DFS, which avoids expanding any already visited states (R&N 3ed Section 3.3, Figure 3.7). Your code should quickly find a solution for:The Pac-Man board will show an overlay of the states explored, and the order in which they were explored (brighter red means earlier exploration). Is the exploration order what you would have expected? Does Pac-Man actually go to all the explored squares on its way to the goal?
Hint: If you use a
Stack
as your data structure, the solution found by your DFS algorithm for mediumMaze
should have a length of 130 (provided you push successors onto the fringe in the order provided by getSuccessors; you might get 244 if you push them in the reverse order). Is this a least cost solution? If not, think about what depth-first search is doing wrong.Question 2 (10 points) Implement the breadth-first search (BFS) algorithm in the
breadthFirstSearch
function in search.py
. Again, write a graph search algorithm that avoids expanding any already visited states. Test your code the same way you did for depth-first search.Does BFS find a least cost solution? If not, check your implementation.Hint: If Pac-Man moves too slowly for you, try the option
--frameTime 0
.Note: If you've written your search code generically, your code should work equally well for the eight-puzzle search problem (R&N 3ed Section 3.2, Figure 3.4) without any changes.
Varying the Cost Function
While BFS will find a fewest-actions path to the goal, we might want to find paths that are 'best' in other senses. ConsidermediumDottedMaze
and mediumScaryMaze
. By changing the cost function, we can encourage Pac-Man to find different paths. For example, we can charge more for dangerous steps in ghost-ridden areas or less for steps in food-rich areas, and a rational Pac-Man agent should adjust its behavior in response.Question 3 (10 points) Implement the uniform-cost search (UCS) algorithm inthe
uniformCostSearch
function in search.py
. We encourage you to look through util.py
for some data structures that may be useful in your implementation. You should now observe successful behavior in all three of the following layouts, where the agents below are all UCS agents that differ only in the cost function they use (the agents and cost functions are written for you):Note: You should get very low and very high path costs for the
StayEastSearchAgent
and StayWestSearchAgent
respectively, due to their exponential cost functions (see searchAgents.py
for details).A* search
Question 4 (15 points) Implement A* graph search in the empty function
aStarSearch
in search.py
. A* takes a heuristic function as an argument. Heuristics take two arguments: a state in the search problem (the main argument), and the problem itself (for reference information). The nullHeuristic
heuristic function in search.py
is a trivial example. You can test your A* implementation on the original problem of finding a path through a maze to a fixed position using the Manhattan distance heuristic (implemented already as
manhattanHeuristic
in searchAgents.py
). You should see that A* finds the optimal solution slightly faster than uniform cost search (about 549 vs. 620 search nodes expanded in our implementation, but ties in priority may make your numbers differ slightly). What happens on openMaze
for the various search strategies? Finding All the Corners
The real power of A* will only be apparent with a more challenging search problem. Now, it's time to formulate a new problem and design a heuristic for it.
In corner mazes, there are four dots, one in each corner. Our new search problem is to find the shortest path through the maze that touches all four corners (whether the maze actually has food there or not). Note that for some mazes like tinyCorners, the shortest path does not always go to the closest food first! Hint: the shortest path through
tinyCorners
takes 28 steps. Question 5 (10 points) Implement the
CornersProblem
search problem in searchAgents.py
. You will need to choose a state representation that encodes all the information necessary to detect whether all four corners have been reached. Now, your search agent should solve: To receive full credit, you need to define an abstract state representation that does not encode irrelevant information (like the position of ghosts, where extra food is, etc.). In particular, do not use a Pac-Man GameState
as a search state. Your code will be very, very slow if you do (and also wrong).Hint: The only parts of the game state you need to reference in your implementation are the starting Pac-Man position and the location of the four corners.
Our implementation of
breadthFirstSearch
expands just under 2000 search nodes on mediumCorners. However, heuristics (used with A* search) can reduce the amount of searching required. Question 6 (15 points) Implement a heuristic for the
CornersProblem
in cornersHeuristic
. Grading: inadmissible heuristics will get no credit. 5 points for any admissible heuristic. 5 points for expanding fewer than 1600 nodes. 5 points for expanding fewer than 1200 nodes. Expand fewer than 800, and you're doing great!Hint: Remember, heuristic functions just return numbers, which, to be admissible, must be lower bounds on the actual shortest path cost to the nearest goal.
Note:
AStarCornersAgent
is a shortcut for -p SearchAgent -a fn=aStarSearch,prob=CornersProblem,heuristic=cornersHeuristic
.Eating All The Dots
Now we'll solve a hard search problem: eating all the Pac-Man food in as few steps as possible. For this, we'll need a new search problem definition which formalizes the food-clearing problem:FoodSearchProblem
in searchAgents.py
(implemented for you). A solution is defined to be a path that collects all of the food in the Pac-Man world. For the present project, solutions do not take into account any ghosts or power pellets; solutions only depend on the placement of walls, regular food and Pac-Man. (Of course ghosts can ruin the execution of a solution! We'll get to that in the next project.) If you have written your general search methods correctly, A*
with a null heuristic (equivalent to uniform-cost search) should quickly find an optimal solution to testSearch with no code change on your part (total cost of 7).Note:
AStarFoodSearchAgent
is a shortcut for -p SearchAgent -a fn=astar,prob=FoodSearchProblem,heuristic=foodHeuristic
.You should find that UCS starts to slow down even for the seemingly simple
Question 7 (20 points) Fill in tinySearch
. As a reference, our implementation takes 2.5 seconds to find a path of length 27 after expanding 4902 search nodes. foodHeuristic
in searchAgents.py
with a ![Pacman For Mac Os Pacman For Mac Os](/uploads/1/1/9/8/119876534/234152032.jpg)
![Pacman Pacman](https://romsmania.com/statics/assets/covers/gameboy-advance/14304front-45535.jpg)
FoodSearchProblem
. Try your agent on the trickySearch
board:Our UCS agent finds the optimal solution in about 13 seconds, exploring over 16,000 nodes. If your heuristic is admissible, you will receive the following score, depending on how many nodes your heuristic expands. Fewer nodes than: | Points |
---|---|
15000 | 5 |
12000 | 15 |
9000 | 20 (medium hard) |
7000 | +5 extra credit (hard) |
If your heuristic is inadmissible, you will receive no credit, so be careful! Think through admissibility carefully, as inadmissible heuristics may manage to produce fast searches and even optimal paths. Can you solve
mediumSearch
in a short time? If so, we're either very, very impressed, or your heuristic is inadmissible. Admissibility vs. Consistency? Technically, admissibility isn't enough to guarantee correctness in graph search -- you need the stronger condition of consistency. For a heuristic to be consistent, it must hold that if an action has cost c, then taking that action can only cause a drop in heuristic of at most c. If your heuristic is not only admissible, but also consistent, you will receive 5 points extra credit.
Almost always, admissible heuristics are also consistent, especially if they are derived from problem relaxations. Therefore it is probably easiest to start out by brainstorming admissible heuristics. Once you have an admissible heuristic that works well, you can check whether it is indeed consistent, too. Inconsistency can sometimes be detected by verifying that your returned solutions are non-decreasing in f-value. Morevoer, if UCS and A* ever return paths of different lengths, your heuristic is inconsistent.
Suboptimal Search
Sometimes, even with A* and a good heuristic, finding the optimal path through all the dots is hard. In these cases, we'd still like to find a reasonably good path, quickly. In this section, you'll write an agent that always eats the closest dot.
ClosestDotSearchAgent
is implemented for you in searchAgents.py
, but it's missing a key function that finds a path to the closest dot. Question 8 (10 points) Implement the function
findPathToClosestDot
in searchAgents.py
. Our agent solves this maze (suboptimally!) in under a second with a path cost of 350:Hint: The quickest way to complete
findPathToClosestDot
is to fill in the AnyFoodSearchProblem
, which is missing its goal test. Then, solve that problem with an appropriate search function. The solution should be very short!Your
ClosestDotSearchAgent
won't always find the shortest possible path through the maze. (If you don't understand why, ask a TA!) In fact, you can do better if you try. Mini Contest (10 points extra credit) Implement an
ApproximateSearchAgent
in searchAgents.py
that finds a short path through the bigSearch
layout. Students who find the shortest path using no more than 30 seconds of computation will receive 10 extra credit points and an in-class demonstration of their brilliant Pac-Man agents. We will time your agent using the no graphics option -q
, and it must complete in under 30 seconds on our grading machines. Please describe what your agent is doing in a comment! We reserve the right to give additional extra credit to creative solutions, even if they don't work that well. Don't hard-code the path, of course. Object Glossary
Here's a glossary of the key objects in the code base related to search problems, for your reference:
SearchProblem (search.py)
- A SearchProblem is an abstract object that represents the state space, successor function, costs, and goal state of a problem. You will interact with any SearchProblem only through the methods defined at the top of
search.py
PositionSearchProblem (searchAgents.py)
- A specific type of SearchProblem that you will be working with --- it corresponds to searching for a single food dot in a maze.
CornersProblem (searchAgents.py)
- A specific type of SearchProblem that you will define --- it corresponds to searching for a path through all four corners of a maze.
FoodSearchProblem (searchAgents.py)
- A specific type of SearchProblem that you will be working with --- it corresponds to searching for a way to eat all the food dots in a maze.
- Search Function
- A search function is a function which takes an instance of SearchProblem as a parameter, runs some algorithm, and returns a sequence of actions that lead to a goal. Example of search functions are
depthFirstSearch
andbreadthFirstSearch
, which you have to write. You are providedtinyMazeSearch
which is a very bad search function that only works correctly ontinyMaze
SearchAgent
SearchAgent
is is a class which implements an Agent (an object that interacts with the world) and does its planning through a search function. TheSearchAgent
first uses the search function provided to make a plan of actions to take to reach the goal state, and then executes the actions one at a time.
PAC-MAN Download for PC: Using android apps on PC is not an impossible feat anymore. If you want to use an Android App on your PC which has no website version or Windows Version, you can still use it on PC. Here, we will let you know about, how can you Download PAC-MAN for PC Windows 10/8/7 and Mac OS X.
First of all, let me tell you that we will be using an Android Emulator to use PAC-MAN on your laptop. Android Emulator is a software that runs an environment of Android Devices on your PC and lets you use the Android Apps on ur Laptop. There are are many Android Emulators available in the market, and we have made a detailed list of all of them for you on our blog. Without further ado, lets move towards the guide on how to use Simulation App – PAC-MAN.
PAC-MAN for PC – Technical Specifications
Title | PAC-MAN for PC |
Category | Arcade Game |
Developed By | BANDAI NAMCO Entertainment America Inc. |
File size | 65M |
Installations | 100,000,000+ |
Rating | 4.0/5.0 |
Req Android version | 4.4 and up |
PAC-MAN lies in the category of Arcade Game on the Android play store. With it’s simple to use and easy to navigate UI, PAC-MAN Game has got over 100,000,000+ installations with an exceptional rating of 4.0 stars from the users.
You can also download the App from play store on your Android Here is the play store link for you –
Developer: BANDAI NAMCO Entertainment America Inc.
PAC-MAN Download and Install on PC
As mentioned earlier, we will be using Android emulators to download and install your favorite Game PAC-MAN on PC. Follow any of the mentioned ways below to install the app on your laptop.
Install PAC-MAN for PC
There are a lot of Android Emulators on the Market nowadays but one of the few best is Bluestacks, Knox, and Memuplay. All of these Emulators are listed by us in our Blog here and you can simply download any of it by going to the link given below in the instructions. So let’s start and move towards the instructions on How can you get your favorite App PAC-MAN on your PC using an Android emulator.
- Step 1: Download Android Emulator on your computer. Download link – Download Emulator of your Choice.
- Step 2: To install the Emulator, double click on the downloaded .exe file of the emulator you downloaded.
- Step 3: Launch the Emulator app now.
- Step 4: First thing you need to do is Log in with your Google account on the next screen.
- Step 4: Next, on the home screen of Emulator, Find the Google Playstore app, and click on it.
- Step 5: After the Google play store opens up, search for – “ to download it on your PC.
- Step 6: Click on the install button to start installing PAC-MAN on Bluestacks PC.
- Step 7: Upon the completion of the installation process, you can find the PAC-MAN app icon in the installed apps folder of your Emulator.
PAC-MAN Download for PC – Features:
Pac-man For Mac Os
THE GLOBAL VIDEO GAME ICON TURNS 40! JOIN THE PAC!Celebrate PAC-MAN's 40th Anniversary with a new UI highlighting the five bold colors of PAC-MAN and the Ghosts. Coming out of the video game world, they will paint your life with fun and excitement. PAC-MAN IS FOR EVERYONE!Enjoy the world famous arcade videogame, PAC-MAN, for FREE! Earn high scores as you guide PAC-MAN through the maze to eat all the pac-dots and fruits while avoiding the pesky Ghost Gang! Or turn them blue by eating a power pellet to chomp on them!Who can forget the retro addictive gameplay of this pop culture icon Remember all those countless hours of free time and quarters spent at the local arcade back in the ྌs Re-live those classic gaming moments on your mobile phone!PAC-MAN is the retro arcade game you know and love, now better than ever before! Join millions of fans and experience this classic along with new features* such as original mazes, weekly tournaments, and token rewards!CLASSIC 8-BIT ARCADE ACTION Now everyone can play the original coin-op icon, PAC-MAN Pixel perfect – Looks, sounds, and feels just like you remember! Addictive old school gameplay – Run away or chase the ghosts!NEW MAZES Unique challenges await with brand new mobile exclusive mazes! Easy to learn, hard to master – Just one more game! The definition of simple and timeless game designDAILY PAC-MISSIONS! Earn token rewards by completing daily gameplay challenges Eat 20 ghosts, eat 4 fruits, get 1000 points, etc. the list goes on and on!TOURNAMENTS Take the weekly tournament maze challenge to earn tokens! Compete at your own pace with 3 difficulty levels Get high scores and climb the leaderboards!TOKEN REWARDS Spend earned tokens to unlock new mazes, or earn more tournament attempts! Earn free daily rewardsRediscover the retro classic all over again! Bring the old school arcade action of PAC-MAN anywhere you go! Did we also mention that PAC-MAN was inducted to the World Video Game Hall of Fame in 2015Download PAC-MAN for FREE today!If you purchased a Bandai Wreck-It Ralph Power Pac Mini Figure Blind Box and want to redeem your toy code, sorry! Ralph has gone into another maze!To redeem your toy code:1. Download the PAC-MAN: Ralph Breaks the Maze app here: https://play.google.com/store/apps/detailsidcom.bandainamcoent.google.pacralph2. Enter your toy code for the corresponding Disney character3. Enjoy!Additional Features: Achievements and Leaderboard support Insider Pro-Tips on how to be the best maze runner in the worldLike us on Facebook: https://www.facebook.com/PACMANForMobileCheck out our website: https://www.bandainamcoent.com/home.html* Some terms and conditions may apply.PAC-MAN & 2020 BANDAI NAMCO Entertainment Inc. BANDAI NAMCO logo is a trademark of BANDAI NAMCO Holdings Inc. Published by BANDAI NAMCO Entertainment America Inc.
Pac-man For Mac Os X
PAC-MAN for PC – Conclusion:
Pac Man For Mac Download
PAC-MAN, is one of the very good Game in the Arcade Game category. BANDAI NAMCO Entertainment America Inc. did a very good job at designing a good UI and UX for Game. We have provided a detailed guide on how to download and install PAC-MAN on PC using emulators of your choice. Now you can download and use the App not only on Android devices but as well as Laptops and PC running Windows OS. if you have any queries regarding the process or the Application please leave the queries in the comment section below, and don’t forget to follow our blog for the latest updates and share as sharing is caring. ?