Random walk1

In class we were introduced to the random walk concept. Elise came up with a concept that:
n= number  of steps
m= number of vertices
x= number of open vertices at each steps
Have been           Have not been at a place
P(x)= n/m           P(1-x) = 1-n/m
x >= 3   creates four mini squares in a pane
P(x=1) = (1- n/m)
P(x=2) = (1- n/m)^2
P(x=3) [...]

Prob. min memory path ending

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 [...]

Random Walk

Two weeks ago we attempted to do random walk starting at zero. Prof. Davis created a Mathematica program to show a random walk graph. He kept changing the values to get the session time it took to walk. Starting it a zero there is only four possible moves left, right, up or down (l, r, [...]

Tower of Hanoi 4 peg

In class on Sept. 30, 2008, we had an interesting session. Elise and Adam lead the class with their recursive patterns for solving the 4 peg system.  The concept was that a 3 peg sytem can be used to give the answer for the minimal amount of moves needed to solve a 4 peg system. [...]