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

Published on 12 May 2024 09:40 PM

How to resolve the algorithm Towers of Hanoi step by step in the FutureBasic 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 FutureBasic programming language

Source code in the futurebasic programming language

window 1, @"Towers of Hanoi", ( 0, 0, 300, 300 )

void local fn Move( n as long, fromPeg as long, toPeg as long, viaPeg as long )
  if n > 0
    fn Move( n-1, fromPeg, viaPeg, toPeg )
    print "Move disk from "; fromPeg; " to "; toPeg
    fn Move( n-1, viaPeg, toPeg, fromPeg )
  end if
end fn

fn Move( 4, 1, 2, 3 )
print
print "Towers of Hanoi puzzle solved."

HandleEvents

  

You may also check:How to resolve the algorithm Detect division by zero step by step in the Common Lisp programming language
You may also check:How to resolve the algorithm Secure temporary file step by step in the Mathematica/Wolfram Language programming language
You may also check:How to resolve the algorithm Rot-13 step by step in the Emacs Lisp programming language
You may also check:How to resolve the algorithm Fairshare between two and more step by step in the Perl programming language
You may also check:How to resolve the algorithm Pseudo-random numbers/Splitmix64 step by step in the Phix programming language