In our class discussion we attempted to find the min memory path ending for the random walk graph. We decided it was 7 since if we start at a point there is only four possible moves left, right , up, dpwn(l,r,u, d). The branches of the four possible moves then create there own three possible moves since it cannot go back to the first move.
We then attempted to find a probability for getting seven has the min memory path ending. We tried to use Bernolli Trial. Which states that sqrt(p (1-p)).
p=(1/4)^7.
4^7= 16384
p= (1/16384)
sqrt [(1/16384)* (1-(1/16384))] = 0.0078
We then tried a different method:
P(x) = (0,1, 2, 3, 4, 5, 6, 7)
the possible move for the first is 4, any other move after is 3, and r = 20,000 (the mathemaitca program attempted a walk for 20, 00 step).
possible move 1st choice 2nd choice
4 * [(1/4) (1/3)^6]
we have to repeat this 20,00o times since it is a walk of 20,000 steps.
