Based off of http://algorithms.wtf

Hanoi.rs

fn main() {  
    let n = 8;
    let mut blank = Vec::with_capacity(8);
    hanoi(n, &mut (0..8).collect(), &mut blank.clone(), &mut blank);
}

//if n > 0
// Hanoi(n − 1, src, tmp, dst) 〈〈Recurse!〉〉 
// move disk n from src to dst
// Hanoi(n − 1, tmp, dst, src) 〈〈Recurse!〉〉

fn hanoi(n: i32,  src: &mut Vec<i32>, dst: &mut Vec<i32>, tmp: &mut Vec<i32>) {
    if n > 0 {
        hanoi(n-1,src,tmp,dst);
        let nth = src.pop().unwrap();
        dst.push(nth);
        hanoi(n-1,tmp,dst,src);
    }
   dbg!((src,dst,tmp));
}