Solve the Towers of Hanoi problem.
Your solution should accept the number of discs as the first parameters, and
three string used to identify each of the three stacks of discs, for example
towerOfHanoi(4, 'A', 'B', 'C')
. The function should return an
array of arrays containing the list of moves, source -> destination. For
example, the array [['A', 'C'], ['B', 'A']]
indicates that the
1st move was to move a disc from stack A to C, and the 2nd move was to move a
disc from stack B to A.
towerOfHanoi
is a function.
testString: 'assert(typeof towerOfHanoi === "function", "towerOfHanoi
is a function.");'
- text: 'towerOfHanoi(3, ...)
should return 7 moves.'
testString: 'assert(res3.length === 7, "towerOfHanoi(3, ...)
should return 7 moves.");'
- text: 'towerOfHanoi(3, "A", "B", "C")
should return [["A","B"],["A","C"],["B","C"],["A","B"],["C","A"],["C","B"],["A","B"]].")'
testString: 'assert.deepEqual(towerOfHanoi(3, "A", "B", "C"), res3Moves, "towerOfHanoi(3, "A", "B", "C")
should return [["A","B"],["A","C"],["B","C"],["A","B"],["C","A"],["C","B"],["A","B"]].");'
- text: 'towerOfHanoi(5, "X", "Y", "Z")
10th move should be Y -> X.'
testString: 'assert.deepEqual(res5[9], ["Y", "X"], "towerOfHanoi(5, "X", "Y", "Z")
10th move should be Y -> X.");'
- text: 'towerOfHanoi(7, "A", "B", "C")
first ten moves are [["A","B"],["A","C"],["B","C"],["A","B"],["C","A"],["C","B"],["A","B"],["A","C"],["B","C"],["B","A"]].")'
testString: 'assert.deepEqual(towerOfHanoi(7, "A", "B", "C").slice(0, 10), res7First10Moves, "towerOfHanoi(7, "A", "B", "C")
first ten moves are [["A","B"],["A","C"],["B","C"],["A","B"],["C","A"],["C","B"],["A","B"],["A","C"],["B","C"],["B","A"]].");'
```