Breaking News: Grepper is joining You.com. Read the official announcement!

Towers of Hanoi Iterative and Recursive

Mackerel answered on June 21, 2022 Popularity 3/10 Helpfulness 3/10

answer Towers of Hanoi Iterative and Recursive

related Towers of Hanoi, Iterative and Recursive

Towers of Hanoi Iterative and Recursive

Comment

//////// Towers of Hanoi Iterative
function HanoiIterative(n: number) {
    const trackDiskPosition = Array(n).fill(0);
    for (let stepCount = 0; stepCount < 2 ** n; ++ stepCount) {
        for (let currentDisk = 0; currentDisk < n; ++ currentDisk) {
            const expectedPosition = count(currentDisk, stepCount);
            if (trackDiskPosition[currentDisk] !== expectedPosition) {
                console.log(`Move disk ${currentDisk + 1} from ${trackDiskPosition[currentDisk] + 1} to ${expectedPosition + 1}`);
                trackDiskPosition[currentDisk] = expectedPosition;
                break;
            }
        }
    }
}

function count(disk: number, step: number) {
    let temp = Math.ceil(
        (step + (disk % 2 === 1 ? 2 ** (disk + 2) : 0) - 2 ** disk + 1)
        / (2 ** (disk + 1))
    ) % 3;
    return disk % 2 === 1 ? 2 - temp : temp;
}

///////// Towers of Hanoi Recursive
function HanoiRecursive(n: number, a: string, b: string, c: string) {
  if (n > 0) {
    HanoiRecursive(n-1, a, c, b);
    console.log("Move disk from " + a + " to " + c);
    HanoiRecursive(n-1, b, a, c);
  }
}

console.log("\nIterative = ");
HanoiIterative(3)

console.log("Recursive = ");
HanoiRecursive(3, "1", "2", "3");

Popularity 3/10 Helpfulness 3/10 Language typescript

Source: Grepper

Tags: towers-of-hanoi typescript

Link to this answer
Share Copy Link

Contributed on Oct 03 2023

Mackerel

0 Answers Avg Quality 2/10

Closely Related Answers

Towers of Hanoi, Iterative and Recursive

Comment

//////// Towers of Hanoi Iterative
function HanoiIterative(n) {
    const trackDiskPosition = Array(n).fill(0);
    for (let stepCount = 0; stepCount < 2 ** n; ++ stepCount) {
        for (let currentDisk = 0; currentDisk < n; ++ currentDisk) {
            const expectedPosition = count(currentDisk, stepCount);
            if (trackDiskPosition[currentDisk] !== expectedPosition) {
                console.log(`Move disk ${currentDisk + 1} from ${trackDiskPosition[currentDisk] + 1} to ${expectedPosition + 1}`);
                trackDiskPosition[currentDisk] = expectedPosition;
                break;
            }
        }
    }
}

function count(disk, step) {
    let temp = Math.ceil(
        (step + (disk % 2 === 1 ? 2 ** (disk + 2) : 0) - 2 ** disk + 1)
        / (2 ** (disk + 1))
    ) % 3;
    return disk % 2 === 1 ? 2 - temp : temp;
}

///////// Towers of Hanoi Recursive
function HanoiRecursive(n, a, b, c) {
  if (n > 0) {
    HanoiRecursive(n-1, a, c, b);
    console.log("Move disk from " + a + " to " + c);
    HanoiRecursive(n-1, b, a, c);
  }
}

console.log("\nIterative = ");
HanoiIterative(3)

console.log("Recursive = ");
HanoiRecursive(3, "1", "2", "3");

Popularity 7/10 Helpfulness 2/10 Language javascript

Source: Grepper

Tags: javascript

Link to this answer
Share Copy Link

Contributed on Jun 21 2022

Mackerel

0 Answers Avg Quality 2/10

Towers of Hanoi Iterative and Recursive

Contents

More Related Answers

Towers of Hanoi Iterative and Recursive

Closely Related Answers

Towers of Hanoi, Iterative and Recursive

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.