Skip to content
This repository has been archived by the owner on Aug 27, 2024. It is now read-only.

Commit

Permalink
Merge pull request #3 from cis1951/hw2
Browse files Browse the repository at this point in the history
upload hw2
  • Loading branch information
fyy26 authored Feb 20, 2024
2 parents 9acb18d + 50cf6ff commit f652609
Show file tree
Hide file tree
Showing 3 changed files with 361 additions and 13 deletions.
2 changes: 1 addition & 1 deletion content/homework/hw0.mdx
Original file line number Diff line number Diff line change
Expand Up @@ -4,7 +4,7 @@ isReleased: true
dueDate: 2024-01-29T23:59:00-05:00
---

[Submit this homework on Canvas.](https://canvas.upenn.edu/courses/1774063/assignments/12057154)
[Submit this assignment on Canvas.](https://canvas.upenn.edu/courses/1774063/assignments/12057154)

Authors: [Jerry Ye](https://github.com/jerry1ye10), [Yuying Fan](https://github.com/fyy26)

Expand Down
16 changes: 8 additions & 8 deletions content/homework/hw1.mdx
Original file line number Diff line number Diff line change
Expand Up @@ -6,7 +6,7 @@ dueDate: 2024-02-12T23:59:00-05:00

[Submit this assignment on Canvas.](https://canvas.upenn.edu/courses/1774063/assignments/12099659)

Authors: [Anthony Li](https://github.com/anli5005)
Author: [Anthony Li](https://github.com/anli5005)

Reviewers: [Jordan Hochman](https://github.com/jhawk0224), [Yuying Fan](https://github.com/fyy26)

Expand All @@ -28,17 +28,17 @@ In a text adventure game, you walk the player through an interactive story. Gene

<pre className="whitespace-pre-wrap prose-strong:text-white">
A flash of light. You're awake. Dazed, you look around. You're in a dark cave, with an exit to the east. You have no idea how you got here. Only one thing is certain: you have to get out.

***<u>east</u>***

Still confused, you sprint towards the light. As you exit the cave, sunlight engulfs you. You're at the edge of a rural village. A villager rests at the side of the road.

***<u>talk</u>***

You approach the villager. "Hello, traveler," she says. "Do you know if it's possible to get from two arbitrary but particular locations via the road network? Let G be an arbitrary but particular graph representing the road network. All I know is that G is an undirected graph with no cycles, and has exactly one fewer road than the number of locations."

All of a sudden, it hits you.

You're trapped in a CIS 1600 homework assignment.
</pre>

Expand Down Expand Up @@ -86,14 +86,14 @@ You'll implement your game as a struct conforming to the `AdventureGame` protoco
public protocol AdventureGame {
/// Creates a new game.
init()

/// Title to be displayed at the top of the game.
var title: String { get }

/// Runs at the start of every game.
/// - Parameter context: The object you use to write output and end the game.
mutating func start(context: AdventureGameContext)

/// Runs when the user enters a line of input.
/// - Parameters:
/// - input: The line the user typed.
Expand Down
Loading

0 comments on commit f652609

Please sign in to comment.