Results for "Author: marcus mason"
Creates a coloured graphical tree based on a simple algorithm, packed with various options you can change.
Play the Towers Of Hanoi game! Move the stack of discs from the left peg, to any of the other 2. You can only move one disc at a time and you cannot put larger discs on smaller ones. You've bound to have seen this game before! Give it a try - my lowest score is 65.
Creates a coloured graphical tree based on a simple algorithm, packed with various options you can change.
Play the Towers Of Hanoi game! Move the stack of discs from the left peg, to any of the other 2. You can only move one disc at a time and you cannot put larger discs on smaller ones. You've bound to have seen this game before! Give it a try - my lowest score is 65.
Creates a coloured graphical tree based on a simple algorithm, packed with various options you can change.
Play the Towers Of Hanoi game! Move the stack of discs from the left peg, to any of the other 2. You can only move one disc at a time and you cannot put larger discs on smaller ones. You've bound to have seen this game before! Give it a try - my lowest score is 65.
Creates a coloured graphical tree based on a simple algorithm, packed with various options you can change.
Play the Towers Of Hanoi game! Move the stack of discs from the left peg, to any of the other 2. You can only move one disc at a time and you cannot put larger discs on smaller ones. You've bound to have seen this game before! Give it a try - my lowest score is 65.
Creates a coloured graphical tree based on a simple algorithm, packed with various options you can change.
Play the Towers Of Hanoi game! Move the stack of discs from the left peg, to any of the other 2. You can only move one disc at a time and you cannot put larger discs on smaller ones. You've bound to have seen this game before! Give it a try - my lowest score is 65.
Creates a coloured graphical tree based on a simple algorithm, packed with various options you can change.
Play the Towers Of Hanoi game! Move the stack of discs from the left peg, to any of the other 2. You can only move one disc at a time and you cannot put larger discs on smaller ones. You've bound to have seen this game before! Give it a try - my lowest score is 65.
Creates a coloured graphical tree based on a simple algorithm, packed with various options you can change.
Play the Towers Of Hanoi game! Move the stack of discs from the left peg, to any of the other 2. You can only move one disc at a time and you cannot put larger discs on smaller ones. You've bound to have seen this game before! Give it a try - my lowest score is 65.
Creates a coloured graphical tree based on a simple algorithm, packed with various options you can change.
Play the Towers Of Hanoi game! Move the stack of discs from the left peg, to any of the other 2. You can only move one disc at a time and you cannot put larger discs on smaller ones. You've bound to have seen this game before! Give it a try - my lowest score is 65.
Creates a coloured graphical tree based on a simple algorithm, packed with various options you can change.
Play the Towers Of Hanoi game! Move the stack of discs from the left peg, to any of the other 2. You can only move one disc at a time and you cannot put larger discs on smaller ones. You've bound to have seen this game before! Give it a try - my lowest score is 65.
Creates a coloured graphical tree based on a simple algorithm, packed with various options you can change.
Play the Towers Of Hanoi game! Move the stack of discs from the left peg, to any of the other 2. You can only move one disc at a time and you cannot put larger discs on smaller ones. You've bound to have seen this game before! Give it a try - my lowest score is 65.