Tower of Hanoi

The edges of the graph are the legal moves of a single top disc. The graph is simple, connected and on a plane. For the Pascal triangle the odd numbers are the legal move and can be connected to form simple, connected triangle on a graph.

Tower of Hanoi

In playing the Tower of Hanoi for a 3 peg with n amount of disk. In order to get the least amount of moves, in class, we derived the formula
M(n) = 2*m(n-1) + 1
M(n)= m(n-1) + 1+ M(n-1)
M(n)= # of moves for n disk. This formula hold true for all n disks on a 3 [...]

Tower of Hanoi, Pascal triangle and sierpinski triangle

I realized that the Sierpinski graph is obtained from drawing a closed equilateral triangle. If we delete the middle triangle and do the same for the subtriangles we end up with the same graph has the tower of Hanoi. The pascal triange Graph if attach all the odd numbers forming triangles we have the [...]

Hello world!

Welcome to WordPress.com. This is your first post. Edit or delete it and start blogging!