프로그래머스 : 하노이의 탑

programers_level3_0.js

function solution(n) {
    var answer = [];
    var hanoi = function(ring,from,by,to){
        if(ring==1){
            answer.push([from,to]);
        }else{
            hanoi(ring-1,from,to,by);
            answer.push([from,to]);
            hanoi(ring-1,by,from,to);
        };
    };
    hanoi(n,1,2,3);
    return answer;
}