Exercise 2
The nature of Mathematics
(Mathematics in Games)
Instructions:
1. Play Tower of Hanoi with 3 discs and then 4 discs. (online or actual)
2. Take note of the steps that you take and the number of steps made before winning.
3. Validate the claim that there will be at least 2n − 1steps to take before winning, where n
is the number of discs.
4. Create an algorithm on how to win the game.
Submit the output in the LMS (moodle) on the set time.
5. Game Modelling Rubric:
Game Modelling Rubric:
1= poor; 2 = Fair; 3 = Good; 4 = Excellent
Problem Identification What is the specific problem your model is going to solve?
Making assumptions and What have you assumed in order to solve the problem?
identifying variables Why did you make these choices?
What pictures, diagrams, or graphs might help us understand
your information, model and results
Doing the Math
Iteration, Analysis and How do you know you have a good/useful model? Why
assessment of the does your model make sense?
solution
Implementation of the What are the important things for us to understand about your
model model and/or solution
Tower of Hanoi
1. prepare 3 (4) discs of different sizes, and 3 sticks. Stack the desired number of discs as
shown in the figure. The bigger disc will be at the bottom of the smaller disc as shown in
the figure.
2. The objective is to get all the discs from one side to the other.
3. You can only move one disc at a time and it must be the upper disc on the stack. A smaller
disc can never be below a larger one.
4. All discs have to be on the pegs unless they are being moved.
The Tower of Hanoi is a mathematical puzzle made up of three
towers and rings of various sizes (number of rings varies based on
the operators) that are stacked in ascending order.
The fastest and easiest way to solve this puzzle is to make as few
steps as possible.
Minimum number of moves required: 2n-1
where n = number of disks
Mission
To relocate all of the disks to another tower without disrupting the
arranging sequence.
Rules
• At any given time, only one disk can be transported between the towers.
• The "top" disk is the only one that may be removed.
• No large disk can be placed on top of a smaller disk.
Tower of Hanoi
(3 disks)
2n-1
= (2)³-1
= 8-1
= 7 moves
Step 1: Move disk 1 from tower A to tower C.
Step 2: Move disk 2 from tower A to tower B.
Step 3: Move disk 1 from tower C to tower B.
Step 4: Move disk 3 from tower A to tower C.
Step 5: Move disk 1 from tower B back to tower A.
Step 6: Move disk 2 from tower B to tower C.
Step 7: Move disk 1 from tower A to tower C.
Tower of Hanoi
(4 disks)
2n-1
= (2)⁴-1
= 16-1
= 15 moves
Step 1: Move disk 1 from tower A to tower B.
Step 2: Move disk 2 from tower A to tower C.
Step 3: Move disk 1 from tower B to tower C.
Step 4: Move disk 3 from tower A to tower B.
Step 5: Move disk 1 from tower C to tower A.
Step 6: Move disk 2 from tower C to tower B.
Step 7: Move disk 1 from tower A to tower B.
Step 8: Move disk 4 from tower A to tower C.
Step 9: Move disk 1 from tower B to tower C.
Step 10: Move disk 2 from tower B to tower A.
Step 11: Move disk 1 from tower C to tower A.
Step 12: Move disk 3 from tower B to tower C.
Step 13: Move disk 1 from tower A to tower B.
Step 14: Move disk 2 from tower A to tower C.
Step 15: Move disk 1 from tower B to tower C.
