Write an assembly language program 8086 Dosbox Tasm -- 4
Budget: $30 – $250 USD
Write an assembly language program that solves the Towers of Hanoi problem.
• The program must prompt the user for a:
- number of disks,
- a starting pole position and
- an ending pole position for a Towers of Hanoi problem.
• The program must generate the series of disk moves to solve the puzzle. The moves should be printed to the screen as a sequence of distinct moves i.e. number each move from the first move to the last move. Redirect the output to a file on the command line. Make liberal use of whitespace to have a nicely formatted output.
• Change the text printed by the Greet procedure so that it prints an appropriate title or name for the program, your name as programmer, and the date on which you turn in your project.
• Your program must work correctly with any possible combination of the proper inputs.
• Pseudo code for an algorithm follows the project description.
• Your program must use recursive procedure (subroutine) calls to solve the problem. Use the BP register to access the parameters on the stack without popping them off. The stack must be cleaned when the procedure returns to itself and the main calling program.
• Your code must be well structured, and it must have comments that make it read like a high-level language with assembly language code inserted after each of the lines of high-level language.
• The program must prompt the user for a:
- number of disks,
- a starting pole position and
- an ending pole position for a Towers of Hanoi problem.
• The program must generate the series of disk moves to solve the puzzle. The moves should be printed to the screen as a sequence of distinct moves i.e. number each move from the first move to the last move. Redirect the output to a file on the command line. Make liberal use of whitespace to have a nicely formatted output.
• Change the text printed by the Greet procedure so that it prints an appropriate title or name for the program, your name as programmer, and the date on which you turn in your project.
• Your program must work correctly with any possible combination of the proper inputs.
• Pseudo code for an algorithm follows the project description.
• Your program must use recursive procedure (subroutine) calls to solve the problem. Use the BP register to access the parameters on the stack without popping them off. The stack must be cleaned when the procedure returns to itself and the main calling program.
• Your code must be well structured, and it must have comments that make it read like a high-level language with assembly language code inserted after each of the lines of high-level language.