Directions:
1) Print the
directions for this assignment before you do anything else.
2) Use your group’s
discussion board to select a group leader
Remember the first person who
volunteers in the group discussion board will have 5 points added to the
Evaluate test score of their
choice or to your Group Grade. Your group leader will organize the group work
using your
group discussion board in blackboard. The
group leader will put up the final report in blackboard
for their group.
3) Use the Group
discussion board to work on and solve the problem below. As a group member it
is your
responsibility to participate
in your group discussion board and to assist in finding a solution to this
problem.
Your instructor will be looking
for evidence or your participation in your Group Discussion Board. This is
where
you will receive credit for
your work.
4) Go to the web
site listed below and play the Tower of Hanoi game.
|
Tower of Hanoi Web Site at http://www.thinks.com/java/hanoi/hanoi.htm Or use the alternative address if this site is not
work. It is very very slow so be patient. http://www.cut-the-knot.com/recurrence/hanoi.shtml You will need to enable the JAVA on your browser to use
this puzzle. You can enable JAVA by opening your browser, clicking
on Tools, then on Internet Options, then on Advanced. Scroll down to where it
says enable JAVA and check it. If you can’t enable the JAVA on your computer go to
this page for information on the Tower of Hanoi: http://www.math.toronto.edu/mathnet/plain/games/towers.html |
|
Rules: The goal is to move all the discs from
the left peg to the right one. Click and drag with the mouse to move a
disc.
Only one disc may be moved at a time. A
disc can only be placed either on an empty peg or on top of a larger disc.
Try to move all the discs using the smallest number of moves possible. |
5) Work with your
group to fill in the table below that shows the least number of moves.
(You may cheat and use Auto
Solve but it won’t be as much fun.) Be sure to use the discussion board under
Groups to show others your ideas and come up with your final
report. Check out other group member’s number
of moves on the Tower of Hanoi.
|
X = Number of Disks Used |
3 |
4 |
5 |
6 |
7 |
8 |
9 |
|
Least Number of Moves Needed to Move All The Disks To
The Right |
|
|
|
|
|
|
|
6) Look at the
number pattern above. See if you can develop an equation that can tell you the
least number of moves
you can make using the number of disks you are using.
Let x = number of disks used. Then find the equation below.
Least Number of Moves =
7) The leader for
your group should post your group’s report to your Group Discussion Board in
your class section
Blackboard by July 9 at 11:59 p.m.
Class Sections |
|
|
Math 03-77D |
Mr. Richard Gill |
|
Math
03-78D
|
Dr. Julia Arnold |
|
Math
03-79D
|
Dr. Marcia Tharp/Ms. Colleen Banks |
|
Grading Criteria: 1)
Accuracy of table = 25 points 2) Correct equation = 25
points 3) Clear and detailed
explanation of how you got the equation. Be
sure to discuss patterns you see when moving the discs = 25 points 4)
Group cooperation = 25 points
Total Points = 100 |
Created by Dr. Marcia L. Tharp
Date: 6/23/02
Send comments to: mailto:%20mtharp@tcc.edu