docs

Author: rtmigo

README.md

@@ -63,13 +63,13 @@ step_right_probs = [0.3, 0.5, 0.7, 0.4, 0.8, 0.9]
 walk = MarkovWalk(step_right_probs)
 ```
 
-- `ever_reach_probs[startPos][endPos]` is the probability, that after
-infinite wandering started at `startPos` we will ever reach the point `endPos`
+- `ever_reach_probs[start_state][end_state]` is the probability, that after
+infinite wandering started at `start_state` we will ever reach the point `end_state`
 
-- `walk.right_edge_probs[pos]` is the probability for a starting point `pos`, that after infinite wandering we will leave 
+- `walk.right_edge_probs[state]` is the probability for a starting `state`, that after infinite wandering we will leave 
 the table on the right, and not on the left
 
-By positions we mean indexes in `step_right_probs`. The point 1 from the example has index `0` in the list. So we will decrease all indices from the example by one.   
+By states we mean `int` indexes in `step_right_probs`.   
 
 ```python3
 # the motion begins at state 2.