This brain teaser is giving Keri sleepless nights!
Sometimes I find weird ways to keep myself occupied when Darren Maule speaks, and this brain teaser is my favourite. Can you crack it?
Usually, I pay 100% attention to Darren Maule when he speaks....except I don't, at all. During this time I need to LOOK busy while occupying my mind.
I thought I would share with you one of the many ways I keep myself busy while Darren thinks I'm doing SO MUCH WORK.
This game kept me going for 20 minutes this morning, it's a lot harder than it looks. It's called Tower of Hanoi. Try it (without the boss watching over your shoulder), and let me know how you did.
The Tower of Hanoi (also called the Tower of Brahma or Lucas' Tower) is a mathematical game or puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod.
The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape.
The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:
1. Only one disk can be moved at a time.
2. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack i.e. a disk can only be moved if it is the uppermost disk on a stack.
3. No disk may be placed on top of a smaller disk.
I thought I would share with you one of the many ways I keep myself busy while Darren thinks I'm doing SO MUCH WORK.
This game kept me going for 20 minutes this morning, it's a lot harder than it looks. It's called Tower of Hanoi. Try it (without the boss watching over your shoulder), and let me know how you did.
The Tower of Hanoi (also called the Tower of Brahma or Lucas' Tower) is a mathematical game or puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod.
The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape.
The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:
1. Only one disk can be moved at a time.
2. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack i.e. a disk can only be moved if it is the uppermost disk on a stack.
3. No disk may be placed on top of a smaller disk.
