Simple recursive try to solve Hanoï in go. The output displays the steps and the total number of iterations

Hanoï.go

package main

import "fmt"

func main() {
fmt.Print("Number of iterations: " , move((uint64)(3), "1", "2", "3", (uint64)(0)))
}

func move(n uint64, a, b, c string,x uint64) uint64  {
	if n > 0 {
		x++
		x=move(n-1, a, c, b,x)
		fmt.Println("Moved from " + a + " to " + c)
		x=move(n-1, b, a, c,x)
	}
	return x
}