COM S
assignment1.03.pdf

assignment1.03.pdf - COM S 327 Spring 2017 Programming...

Info icon This preview shows pages 1–2. Sign up to view the full content.

COM S 327, Spring 2017 Programming Project 1.03 Path Finding So far, we’ve got this lovely dungeon. And we can . . . save and restore it. And, you know . . . look at it. And that’s about it. Nice for mom’s fridge, but otherwise kind of boring. Once you have monsters (next week), they (at least the smart ones) will need to find a path to the player through the dungeon. To find that path, you’ll need to implement a path-finding algorithm. We’re going to have some monsters that can tunnel through walls and others that can only move through open space, so we’ll actually need two slightly different pathfinding algorithms. In both cases we’ll use Dijkstra’s Algorithm, treating each cell in the dungeon as a node in a graph. For the non-tunneling monsters, we’ll give a weight of 1 for floor and ignore wall cells (i.e., don’t try to find paths through walls; this actually degenerates to BFS, and you’re welcome to use that, but we will not require you to implement two different–if very similar–algorithms for this assignment). For the tunnelers, we’ll have to use weights based on the hardness;
Image of page 1

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

Image of page 2
This is the end of the preview. Sign up to access the rest of the document.
  • Fall '16
  • Jeremy Sheaffer
  • Graph Theory, Priority queue, dungeon, monster distance map

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern