diff --git a/maze_solver_design_report.md b/maze_solver_design_report.md
index 5f23a68..3c9860c 100644
--- a/maze_solver_design_report.md
+++ b/maze_solver_design_report.md
@@ -53,7 +53,7 @@ This is the general flow of the chip:
 
 **Intake Walls**
 1. `INPUT (S1)`: Wait for the external input_enable input pin to go high, indicating that input `cur_wall [3:0]` is valid for the requested address `req_addr [7:0]` output. Then go to `LOAD (S2)`.
-1. `LOAD (S2)`: Save `cur_wall` input at the start of the datapath. If the input is 0000, we've reached the end so jump to LAST (S11); otherwise, continue to `RIGHT (S3)`.
+1. `LOAD (S2)`: Save `cur_wall` input at the start of the datapath. If the input is `0000`, we've reached the end so jump to LAST (S11); otherwise, continue to `RIGHT (S3)`.
 
 **Move Decision**
 1. `RIGHT (S3)`: Check to see if a right turn is possible. If so, go to `CHECK (S7)`; otherwise, continue to `UP (S4)`.
@@ -69,7 +69,7 @@ This is the general flow of the chip:
 
 **Output Solution**
 1. `LAST (S11)`: Check to see if the last move has been read. If so, go to `DONE (S13)`; otherwise, go to `OUTPUT (S12)`.
-1. `OUTPUT (S12)`: Read value from stack, starting from the bottom, to the solution [1:0] output. Go to `LAST (S11)`.
+1. `OUTPUT (S12)`: Read value from stack, starting from the bottom, to the `solution [1:0]` output. Go to `LAST (S11)`.
 1. `DONE (S13)`: Wait for external rst signal to go back to `IDLE (S0)`.
 
 ## 3. Datapath Design