Pep8 instructions

projects/adventure/README.md

@@ -1,6 +1,6 @@
 ## Description
 
-You are provided with a pre-generated graph consisting of 500 rooms. You are responsible for filling `traversalPath` with directions that, when walked in order, will visit every room on the map at least once.
+You are provided with a pre-generated graph consisting of 500 rooms. You are responsible for filling `traversal_path` with directions that, when walked in order, will visit every room on the map at least once.
 
 Open `adv.py`. There are four parts to the provided code:
 
@@ -10,7 +10,7 @@ Open `adv.py`. There are four parts to the provided code:
 * REPL code. You can uncomment this and run `python3 adv.py` to walk around the map.
 
 
-You may find the commands `player.currentRoom.id`, `player.currentRoom.getExits()` and `player.travel(direction)` useful.
+You may find the commands `player.current_room.id`, `player.current_room.get_exits()` and `player.travel(direction)` useful.
 
 To solve this path, you'll want to construct your own traversal graph. You start in room `0`, which contains exits `['n', 's', 'w', 'e']`. Your starting graph should look something like this:
 
@@ -29,7 +29,7 @@ Try moving south and you will find yourself in room `5` which contains exits `['
 }
 ```
 
-You know you are done when you have exactly 500 entries (0-499) in your graph and no `'?'` in the adjacency dictionaries. To do this, you will need to write a traversal algorithm that logs the path into `traversalPath` as it walks.
+You know you are done when you have exactly 500 entries (0-499) in your graph and no `'?'` in the adjacency dictionaries. To do this, you will need to write a traversal algorithm that logs the path into `traversal_path` as it walks.
 
 ## Hints
 
@@ -48,8 +48,8 @@ If all paths have been explored, you're done!
 ## Minimum Viable Product
 
 * __1__: Tests do not pass
-* __2__: Tests pass with `len(traversalPath) <= 2000`
-* __3__: Tests pass with `len(traversalPath) < 960`
+* __2__: Tests pass with `len(traversal_path) <= 2000`
+* __3__: Tests pass with `len(traversal_path) < 960`
 
 ## Stretch Problems