Upload File

towers of hanoi

prev
next
out of 36
Download Towers of Hanoi

Upload: roy-sarkis

Post on 05-Mar-2016

221 views

Category:

Documents


0 download

Report

DESCRIPTION

Towers of Hanoi in C++

TRANSCRIPT

  • The Towers of Hanoi

    I Authors: Martin Hofmann and Berteun Damman

    I The idea and visualization were by Martin Hofmann, BerteunDamman programmed the actual recursion.

  • Tower of Hanoi 1 Disc

    1

  • Tower of Hanoi 1 Disc

    1

    Moved disc from pole 1 to pole 3.

  • Tower of Hanoi 1 Disc

    1

    OK

  • Tower of Hanoi 2 Discs

    2

    1

  • Tower of Hanoi 2 Discs

    2 1

    Moved disc from pole 1 to pole 2.

  • Tower of Hanoi 2 Discs

    1 2

    Moved disc from pole 1 to pole 3.

  • Tower of Hanoi 2 Discs

    2

    1

    Moved disc from pole 2 to pole 3.

  • Tower of Hanoi 2 Discs

    2

    1

    OK

  • Tower of Hanoi 3 Discs

    3

    2

    1

  • Tower of Hanoi 3 Discs

    3

    2

    1

    Moved disc from pole 1 to pole 3.

  • Tower of Hanoi 3 Discs

    3 2 1

    Moved disc from pole 1 to pole 2.

  • Tower of Hanoi 3 Discs

    3 2

    1

    Moved disc from pole 3 to pole 2.

  • Tower of Hanoi 3 Discs

    2

    1

    3

    Moved disc from pole 1 to pole 3.

  • Tower of Hanoi 3 Discs

    1 2 3

    Moved disc from pole 2 to pole 1.

  • Tower of Hanoi 3 Discs

    1 3

    2

    Moved disc from pole 2 to pole 3.

  • Tower of Hanoi 3 Discs

    3

    2

    1

    Moved disc from pole 1 to pole 3.

  • Tower of Hanoi 3 Discs

    3

    2

    1

    OK

  • Tower of Hanoi 4 Discs

    4

    3

    2

    1

  • Tower of Hanoi 4 Discs

    4

    3

    2

    1

    Moved disc from pole 1 to pole 2.

  • Tower of Hanoi 4 Discs

    4

    3

    1 2

    Moved disc from pole 1 to pole 3.

  • Tower of Hanoi 4 Discs

    4

    3

    2

    1

    Moved disc from pole 2 to pole 3.

  • Tower of Hanoi 4 Discs

    4 3 2

    1

    Moved disc from pole 1 to pole 2.

  • Tower of Hanoi 4 Discs

    4

    1

    3 2

    Moved disc from pole 3 to pole 1.

  • Tower of Hanoi 4 Discs

    4

    1

    3

    2

    Moved disc from pole 3 to pole 2.

  • Tower of Hanoi 4 Discs

    4 3

    2

    1

    Moved disc from pole 1 to pole 2.

  • Tower of Hanoi 4 Discs

    3

    2

    1

    4

    Moved disc from pole 1 to pole 3.

  • Tower of Hanoi 4 Discs

    3

    2

    4

    1

    Moved disc from pole 2 to pole 3.

  • Tower of Hanoi 4 Discs

    2 3 4

    1

    Moved disc from pole 2 to pole 1.

  • Tower of Hanoi 4 Discs

    2

    1

    3 4

    Moved disc from pole 3 to pole 1.

  • Tower of Hanoi 4 Discs

    2

    1

    4

    3

    Moved disc from pole 2 to pole 3.

  • Tower of Hanoi 4 Discs

    2 1 4

    3

    Moved disc from pole 1 to pole 2.

  • Tower of Hanoi 4 Discs

    1 4

    3

    2

    Moved disc from pole 1 to pole 3.

  • Tower of Hanoi 4 Discs

    4

    3

    2

    1

    Moved disc from pole 2 to pole 3.

  • Tower of Hanoi 4 Discs

    4

    3

    2

    1OK

  • Tower of Hanoi 5 Disc

    5

    4

    3

    2

    1 ?


More Recursion: Permutations and Towers of Hanoi · Recursive Permutation Algorithm Recursive Permutation code in detail: 2 parameters to the function 1) The string we want to permute

elevate your flexibility...Belgium), Jumeirah Emirates Towers (Dubai, EAU) and the Pacific Hotel (Hanoi, Vietnam). Innovation for progress ... integrates low-level flooring with Legrand’s

Towers of Hanoi - ECE:Course Pagecourse.ece.cmu.edu/.../Welcome_files/TeamC-finalReport.pdf · 2007. 5. 11. · Abstract This report details the development and final implementation

More Recursion: Permutations and Towers of Hanoi

ÖZYİNELEME - Egeyzgrafik.ege.edu.tr/~ugur/12_13_Fall/DS/DS_04_RECURSION.pdf · Örnek 4 : Hanoi Kuleleri Problemi (Towers of Hanoi Problem) Üç kule (A,B,C) olan bir sistemde yarıçapı

Joon’s Math File STAY OUT!. Towers of Hanoi Langton’s Ant

The Hanoi Towers

Tower of Hanoi

HANOI INDEPENDENT LIVING CENTER 1. Hanoi Independent Living Center of People with Disabilities 42 Kim Ma Thuong st., Hanoi, Vietnam Hanoi, Vietnam [email protected]

RECURSION Recursion Towers of Hanoi To Recurse or to Loop? Fractals Do something!

A Formalisation of the Generalised Towers of Hanoi

Business hotels in hanoi: Hanoi Imperial Hotel

Towers of Hanoi Move n (4) disks from pole A to pole C such that a disk is never put on a smaller disk A BC ABC

Tower of hanoi

Tower of Hanoi Link 1 Tower of Hanoi Link 1 Tower of Hanoi Link 2 Tower of Hanoi Link 2

The Towers of Hanoi - math.cmu.edu

Modified Hanoi Towers Groups and Limit Spaces ...arxiv.org/pdf/0909.3520.pdfgroups, a generalization of the Hanoi Towers groups, and give conditions for them to be contractive. We

Towers Of Hanoi - BrandeisTowers Of Hanoi a.k.a. Pyramid Piling Puzzle, Rainbow Puzzle, Brahma Puzzle Very old design, this puzzle purchased from Bits And Pieces 2007. (wood stand

Binary Search - math.uic.edu › ~jan › mcs360 › binary_search.pdf · Binary Search 1 Recursive Problem Solving the towers of Hanoi recursive C++ code 2 Binary Search sorted vectors

Towers of Hanoi - Electrical and Computer Engineering at …ece578/teams/C/Site/Welco… ·  · 2007-05-11This report details the development and final implementation of the Towers

TIME - lniuma.files.wordpress.com · Execuve funconing was assessed through four tasks of the ENFEN baery (Fluency, Trail-Making –Black&White and colour versions-, Hanoi´s Towers

sites.sphdigital.com · Singapore International School @ Gamuda Gardens, Hanoi KinderWorld International Kindergarten @ Hanoi Towers KinderWorld International Kindergarten @ Ciputra

The Towers of Hanoi or Apocalypse When?. A Legend Legend has it that there were three diamond needles set into the floor of the temple of Brahma in Hanoi

Co-Curricular - United Nations International School of Hanoi · 2015. 8. 18. · 2015-2016. 2 UNIS Hanoi Values & Beliefs Because UNIS Hanoi values LEARNING, UNIS Hanoi believes

EE 271 Final Project - Towers of Hanoi - · PDF fileEE 271 Final Project - Towers of Hanoi Siyu Jian, Michael Molina, Kendrick Tang December 6, 2012 Abstract In this project, we designed

Preparatory Problems - PianetaChimica · Lam Ngoc Thiem, Hanoi University of Science, VNU-Hanoi Ngo Thi Thuan, Hanoi University of Science, VNU-Hanoi Vu Quoc Trung, Hanoi National

1 Chapter 1 RECURSION. 2 Chapter 1 Subprogram implementation Recursion Designing Recursive Algorithms Towers of Hanoi Backtracking Eight Queens

05 Intelligent Systems-SearchMethods · Examples of Problems: Towers of Hanoi • 3 pegs A, B, C • 3 discs represented as natural numbers (1, 2, 3) which correspond to the size

Binary Search - University of Illinois at Chicagohomepages.math.uic.edu/~jan/mcs360f10/binary_search.pdfMCS 360 L-22 13 Oct 2010 Recursive Problem Solving the towers of Hanoi recursive

Preparatory Problems · Lam Ngoc Thiem, Hanoi University of Science, VNU-Hanoi Ngo Thi Thuan, Hanoi University of Science, VNU-Hanoi Vu Quoc Trung, Hanoi National University of Education

The Towers of Hanoi problem with a relaxed placement rule

Towers of Hanoi. Introduction This problem is discussed in many maths texts, And in computer science an AI as an illustration of recursion and problem

The Towers of Hanoi 1 2 3 The Initial Position in the Tower of Hanoi. Rules: --Move all the disks from the first needle to the third, subject to the conditions

Towers of Hanoi Hanoiklein.jpg

International School In Hanoi Vietnam | UNIS Hanoi