Attribution Non-Commercial (BY-NC)

42 views

Attribution Non-Commercial (BY-NC)

- UoS Outline BUSS3500 SEM2 2013 Approved
- ASI Darpan
- Preparing for Pre-Employment Math Testing
- Reinventing Education for the 21st Century a New Paradigm
- Problem_BasedLP.pdf
- Archways_Child_Leaflet.pdf
- Seminar Report
- Excerpt from book
- hamilton reflection part 2
- Mindfield Newsletter #1
- Security Management SpecialistSkills and Knowledge
- Reseach Paper in FS
- Appreciation
- part one
- Portfolio Unit Plan
- cognitive rigor matrix math science
- Business Communication
- danielleseymour
- GAS Management fis
- Interaction2005 Version Final

You are on page 1of 4

X, Y, and Z; disks marked A, B, C, D, ... of different radii but

the same thickness; paper and pencil.

and formula design.

formulas.

and C are place on tower X in order from smallest (C on top) to

largest (A on bottom). In each movement to be made, a larger

disk is never placed on top of a smaller disk. After a series

of movements, disks A, B, and C must all be on either tower Y or

Z in the original order of sizes (smallest on top to largest on

bottom). One disk movement constitutes a "move." The same

basic problem can be used for 4, 5, or any number of disks.

minimum number of moves. In listing the positions of A, B, and

C on X, Y, and Z, make sure to list them from bottom to top as

shown in the sample solution. Keep a record of your trials

using the chart provided. After finding the minimum number of

moves for 3, 4, 5, 6, ... disks, devise a formula for the

minimum number of moves for n disks.

three disks on the three towers at the completion of each move.

#

0 A, B, C ------ ------

1 A, B C ------

2 A C B

3 A ------ B, C

4 ------ A B, C

5 C A B

6 C A, B ------

7 ------ A, B, C ------

Funded in part by the National Science Foundation and Indiana University 1995

Evaluation: Each team will submit a report with charts for their trials

properly completed and will be prepared to present their solutions orally.

The minimum number of movements for each number of disks and the

formula for the minimum number of moves for n disks must be listed to get

full credit.

Extensions: Teams can find the minimum number of moves for any given

number of n disks using four towers.

Teacher Notes: Students have to check whether they have done the

movements in proper order and the entries are made correctly. They may

have to redo the activity to confirm the numbers.

Funded in part by the National Science Foundation and Indiana University 1995

Brahma Tower

Student Data Sheet

Record moves made to move four disks from Tower X to either Tower Y or Z.

#

0 A, B, C, D ------ ------

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

Brahma Tower

Student Data Sheet

Record moves made to move five disks from Tower X to either Tower Y or Z.

#

0 A, B, C, D, E ------ ------

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

- UoS Outline BUSS3500 SEM2 2013 ApprovedUploaded byMichaelTimothy
- ASI DarpanUploaded byRajendra K.C.
- Preparing for Pre-Employment Math TestingUploaded bySteve da Rivia
- Reinventing Education for the 21st Century a New ParadigmUploaded bymarkslang
- Problem_BasedLP.pdfUploaded byDrakeRlwill3
- Archways_Child_Leaflet.pdfUploaded byamincu
- Seminar ReportUploaded bysafreed
- Excerpt from bookUploaded bydr_hawk_levins
- hamilton reflection part 2Uploaded byapi-380367681
- Mindfield Newsletter #1Uploaded byDeepankar Anil Kumar
- Security Management SpecialistSkills and KnowledgeUploaded byPrashanthPrashanth
- Reseach Paper in FSUploaded byHeraHeccate
- AppreciationUploaded byHafiy Wak
- part oneUploaded byapi-235360943
- Portfolio Unit PlanUploaded byMrsCrocker
- cognitive rigor matrix math scienceUploaded byapi-245634959
- Business CommunicationUploaded byMuhammad Junaid
- danielleseymourUploaded byapi-251894726
- GAS Management fisUploaded byShafiq Hawamda
- Interaction2005 Version FinalUploaded bypk33
- folio final 9Uploaded byapi-298381854
- Technochemistry-2Uploaded byRoberto Correa
- amanda conner - december 21 seminar reflection 1Uploaded byapi-403223123
- technology use in physical educationUploaded byapi-239033587
- technology use in physical educationUploaded byapi-238363612
- FOR-CAIROUploaded byCairoden
- 2_1_1_GarrettUploaded byLenna Nica
- 4Uploaded byapi-402704802
- Interview Questions for FresherUploaded byThandavakrishna Garikapati
- Final OB QuesUploaded byHarsimran Singh

- Intelligent Robots With FANUC Force SensorsUploaded bySanrasni
- A1 Dennet,Brain ChildrenUploaded bygreekfire10
- 1. System Analysis & DesignUploaded byBijay Mishra
- datastageUploaded bySai Vishnu Vardhan
- Business ObjectsUploaded byBhalimidi Barat
- opnav-n9210-3Uploaded byRobert Vale
- Computer Graphics Principles and PracticeUploaded byAnimesh Agarwal
- SignLab9 TrialGuide OnlineUploaded byunoradean
- SWOT AnalysisUploaded byAbdullah Al Momen
- Time Series ClassificationUploaded byi_khandelwal
- lectr12aUploaded bySharanya Vaidyanath
- Optical Music Recognition: Staffline Detectionand RemovalUploaded byAnonymous vQrJlEN
- Hospital Management Documentation)Uploaded byDesh Deepak Srivastav
- RBI Guidelines SummaryUploaded bygulrukh142
- NX Advanced Simulation Fact SheetUploaded bypatrickNX9420
- [Tutorial] Tor, i2P and PrivoxyUploaded byinvisibolt
- Design Patterns(bd,sl,st,sf)Uploaded byprasad.dls
- VirtualUploaded byjackjill1021
- Trees NetworksUploaded byAugusto Cabrera
- Artificial IntelligenceUploaded byleenamanta
- sql11g_01Uploaded bySreenivasa Reddy Gopireddy
- requestforproposalrfpUploaded byapi-299105232
- Bayesian IbrahimUploaded byulirschj
- NEW TO THE TOUCHUploaded bypatalno
- R18 OnDemDataLoadUploaded bythevinnie
- MA2262 — PROBABILITY AND QUEUEING THEORY.pdfUploaded byvelkarthi92
- mva04Uploaded byRicky
- Tips de LinuxUploaded byTony Puga
- IEEECSStyleGuide2013.pdfUploaded bymy_khan20027195
- OpenCL Image Convolution Filter - Box FilterUploaded bypi194043