How to resolve the algorithm Towers of Hanoi step by step in the BQN programming language

Published on 12 May 2024 09:40 PM
#Bqn

How to resolve the algorithm Towers of Hanoi step by step in the BQN programming language

Table of Contents

Problem Statement

Solve the   Towers of Hanoi   problem with recursion.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Towers of Hanoi step by step in the BQN programming language

Source code in the bqn programming language

Move ← {
    𝕩⊑⊸≤0 ? ⟨⟩;
    𝕊 n‿from‿to‿via:
    l ← 𝕊 ⟨n-1, from, via, to⟩
    r ← 𝕊 ⟨n-1, via, to, from⟩
    l∾(<from‿to)∾r
}
{"Move disk from pole "∾(•Fmt 𝕨)∾" to pole "∾•Fmt 𝕩}´˘>Move 4‿1‿2‿3


┌─                                 
╵"Move disk from pole 1 to pole 3  
  Move disk from pole 1 to pole 2  
  Move disk from pole 3 to pole 2  
  Move disk from pole 1 to pole 3  
  Move disk from pole 2 to pole 1  
  Move disk from pole 2 to pole 3  
  Move disk from pole 1 to pole 3  
  Move disk from pole 1 to pole 2  
  Move disk from pole 3 to pole 2  
  Move disk from pole 3 to pole 1  
  Move disk from pole 2 to pole 1  
  Move disk from pole 3 to pole 2  
  Move disk from pole 1 to pole 3  
  Move disk from pole 1 to pole 2  
  Move disk from pole 3 to pole 2" 
                                  ┘

You may also check:How to resolve the algorithm Euler method step by step in the Sidef programming language
You may also check:How to resolve the algorithm Loops/Increment loop index within loop body step by step in the EasyLang programming language
You may also check:How to resolve the algorithm Numbers which are not the sum of distinct squares step by step in the Perl programming language
You may also check:How to resolve the algorithm Seven-sided dice from five-sided dice step by step in the Wren programming language
You may also check:How to resolve the algorithm Combinations and permutations step by step in the ALGOL 68 programming language