docs

Author: rtmigo

README.md

@@ -23,9 +23,9 @@ We know which car the drunkard is in now. The questions are:
 We are dealing with a discrete 1D random walk. At each state, we have different probabilities of
 making step to the left or to the right.
 
-| States        |   L   |   0   |  -1-  |    2  |   3   |   4   |   5   |   R   |
+| States        |   L   |   0   |  < 1 >  |    2  |   3   |   4   |   5   |   R   |
 |---------------|-------|-------|-------|-------|-------|-------|-------|-------|
-| P(move right) |  ...  | **0.3**|  0.5  |**0.7**|  0.4  |  0.8  |  0.9  |  ...  |
+| P(move right) |  ...  | < 0.3 > |  0.5  | < 0.7 > |  0.4  |  0.8  |  0.9  |  ...  |
 | P(move left)  |  ...  |  0.7  |  0.5  |  0.3  |  0.6  |  0.2  |  0.1  |  ...  |
 
 The probability to get from state `1` to state `2` is `0.7`.