Scribd Logo
Unggah

Selamat datang di Scribd!

  • Step 1 - Apply Formula On 511: Moves (M) and Calculate No. of Disks

    Diunggah oleh

    Bilal Anwar
    3 tayangan1 halaman
    This document provides steps to calculate the number of disks and moves in the Tower of Hanoi problem. It explains that the number of moves (m) is equal to 2^n - 1, where n is the number of disks. It also provides a formula to calculate n (the number of disks) from m (the number of moves) by taking the log base 2 of m+1. The document then gives an example of using these formulas to calculate n from a given m of 511. It concludes by outlining the three steps of the Tower of Hanoi algorithm to transfer n disks from one rod to another.

    Deskripsi Asli:

    Algorithm of tower of honei

    Judul Asli

    algo of toh

    Hak Cipta

    © © All Rights Reserved

    Format Tersedia

    DOCX, PDF, TXT atau baca online dari Scribd

    Apakah menurut Anda dokumen ini bermanfaat?

    Apakah konten ini tidak pantas?

    Laporkan Dokumen Ini
    This document provides steps to calculate the number of disks and moves in the Tower of Hanoi problem. It explains that the number of moves (m) is equal to 2^n - 1, where n is the number of disks. It also provides a formula to calculate n (the number of disks) from m (the number of moves) by taking the log base 2 of m+1. The document then gives an example of using these formulas to calculate n from a given m of 511. It concludes by outlining the three steps of the Tower of Hanoi algorithm to transfer n disks from one rod to another.

    Hak Cipta:

    © All Rights Reserved
    Unduh sebagai DOCX, PDF, TXT atau baca online dari Scribd
    Tandai sebagai konten tidak pantas
    3 tayangan1 halaman

    Step 1 - Apply Formula On 511: Moves (M) and Calculate No. of Disks

    Diunggah oleh

    Bilal Anwar
    This document provides steps to calculate the number of disks and moves in the Tower of Hanoi problem. It explains that the number of moves (m) is equal to 2^n - 1, where n is the number of disks. It also provides a formula to calculate n (the number of disks) from m (the number of moves) by taking the log base 2 of m+1. The document then gives an example of using these formulas to calculate n from a given m of 511. It concludes by outlining the three steps of the Tower of Hanoi algorithm to transfer n disks from one rod to another.

    Hak Cipta:

    © All Rights Reserved
    Unduh sebagai DOCX, PDF, TXT atau baca online dari Scribd
    Tandai sebagai konten tidak pantas
    dari 1

    To find no of moves:

    𝒎 = 𝟐^𝒏 − 𝟏

    To find no of disks:
    𝒍𝒐𝒈(𝒎+𝟏)
    𝒏=
    Step 1 –apply formula on 511 𝒍𝒐𝒈(𝟐)

    moves(m) and calculate no. of


    disks n.
    𝒍𝒐𝒈⁡(𝒎+𝟏) ∴ ⁡𝒎 = 𝒎𝒊𝒏𝒊𝒎𝒖𝒎⁡𝒏𝒐. 𝒐𝒇⁡𝒎𝒐𝒗𝒆𝒔⁡
    𝒏= 𝒍𝒐𝒈⁡(𝟐) ∴ ⁡𝒏 = 𝒏𝒐. 𝒐𝒇⁡𝒅𝒊𝒔𝒌𝒔

    Step 1 − Move n-1 disks from


    source(A) to auxiliary(B).

    Step 2 − Move nth disk from source(A) to destination(C).

    Step 3 − Move n-1 disks from auxiliary(B) to destination(C).

    Anda mungkin juga menyukai