I think this is going to be a vague question because I don\'t know exactly what I am doing in the first place but here it goes.
My code in lisp is as follows: (defun solve-hanoi(from) (hanoi (length from) from \'() \'())) (defun hanoi(height from to aux) (when (>= height 1)
For an assignment I have to create Towers of Hanoi in Common LISP with named discs. I need to get output that looks something like this:
I am learning Scheme and as a toy example I am doing a solution verifier (not a solver) for Towers of Hanoi.
开发者_如何学JAVAThis is code from a book I have explaining recursion. The problem is that I don\'t understand the steps taken by the program:
It hurts to ask it here. It really does. Every time I search in vain for the answers to my troubles, I see it. Taunting me. Stack Overflow.
I developed a solution for the Tower of Hanoi problem: public static void bewege(int h, char quelle, char ablage, char ziel) {
Suppose that there are 2*n disks, How could be Hanoi problem solved if odd numbers are disks on bar \"A\" and even disks are on bar \"B\"?
Locked. This question and its answers are locked because the question i开发者_运维知识库s off-topic but has historical significance. It is not currently accepting new answers or interactions.
I just started trying to learn programming so i am taking a class at my local community college and we have to make a program of the tower of hanoi i have been reading books going to the library and w
加载中,请稍侯......