@@ -60,10 +60,9 @@ Following Part 1, you should infer an occupation and animal based on the text yo
in `graphputer`'s memory embedded after the `mmio` nodes. There will be a hex number associated with that node. You should submit that hex number to `gitlab`
for this part.
# Part 3
Coming soon.
# Part 3: Teleportation and Turtles
Now we move on to a full exploration of the entire graph. **WARNING: This is by far the hardest algorithmic task in the entirety of CS 2. You've been warned.**
# Later Graphputer Commands
-`touch`
-`reboot`
-`teleport`
Unfortunately for us, `graphputer` only lets us visit a single node at a time. This means "backtracking", which is necessary for exploring the entirety of the memory graph, is basically impossible. However! Graphputer provides a way to make particular nodes "save points" that can be "teleported" to later. Specifically, the `touch` command can cycle through 256 possible "save values". Every time you run the `touch` command, the current node's save value increases by one (wrapping around to 0, as it can only store a single byte). If you have previously `touch`ed a node, you can `teleport` to it using `teleport #` where `#` is the "save value". If you have multiple nodes with the same "save value", `graphputer` will refuse to decide for you which node to go to and error.
Your task for this part is to explore the directed part of the graph and find something interesting to work with. The final result will be a string you can submit to gitlab.
