JavaScript recursive function implements 'Tower of Hanoi'

This article mainly introduces the implementation of "Tower of Hanoi" by JavaScript recursive function. It has certain reference value. Now I share it with you. Friends in need can refer to it.

"Tower of Hanoi" is A famous puzzle game. The tower has three pillars and a set of hollow disks with different diameters. At the beginning, all the disks on the column are stacked in order from small to large. The goal is to move a pile of disks to the target column by moving one disk to another column at a time. In the process, larger disks are not allowed to be placed on smaller disks.

Interpret this passage carefully. If there are 10 discs or more, the number of steps will definitely be shocking, but the goal is to move a bunch of discs to the target pillar. If the above The 9 discs are regarded as one set, and the 10th disc is regarded as another set. First move the 9 discs to another pillar, and then the 8 discs above are regarded as a set, and the 9th disc is regarded as Another set... By analogy, decomposition and movement, the idea of ​​​​recursive functions is reflected.

Complete the code, very simple way to write it. I wonder if there is a simpler way to write it?

var hanoi = function {disc, begin, end, helper) {    if (disc > 0) {
        hanoi(disc - 1, begin, helper, end);
        document.writeln('移动圆盘 ' + disc + ' 从 ' + begin + ' 到 ' + helper);
        hanoi(disc - 1, end, begin, helper);
    }
};

hanoi(3, '柱子一', '柱子二', '柱子三');

Output when the number of discs is 3:

Move 1 from pillar one to pillar three
Move 2 from pillar one To pillar two
Move 1 From pillar three to pillar two
Move 3 From pillar one to pillar three
Move 1 From pillar two to pillar one
Move 2 From pillar two to pillar three
Move 1 from pillar one to pillar three

The parameters passed to the hanoi function include the currently moved disk number and the three pillars it will use. When it calls senior, it processes the disk above the one currently being processed. Eventually, it will be called with a disk number that does not exist. In such cases it does nothing. Since this function ignores illegal values, there is no need to worry about causing an infinite loop.

The above is the entire content of this article. I hope it will be helpful to everyone's study. For more related content, please pay attention to the PHP Chinese website!

Related recommendations:

How to use pure JS code to determine how many Chinese characters are in a string

Use JavaScript to determine how many Chinese characters there are in a string How to get the barcode

The above is the detailed content of JavaScript recursive function implements 'Tower of Hanoi'. For more information, please follow other related articles on the PHP Chinese website!