Tell us what’s happening:
dont know where the issue is im stuck tried every order and still stuck
Your code so far
def hanoi_solver(n):
source=[i for i in range(n,0,-1)]
aux=[]
dest=[]
res=[]
res.append(f"{source} {aux} {dest}")
if(n%2==1):
move_disk(n,source,dest,aux,res)
else:
move_disk(n,source,aux,dest,res)
return "\n".join(res)
def move_disk(n,source,aux,dest,res):
if(n==1):
disk = source.pop()
dest.append(disk)
res.append(f"{source} {aux} {dest}")
return
move_disk(n-1,source,dest,aux,res)
disk = source.pop()
dest.append(disk)
res.append(f"{source} {aux} {dest}")
move_disk(n-1,aux,source,dest,res)
Your browser information:
User Agent is: Mozilla/5.0 (X11; Linux x86_64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/149.0.0.0 Safari/537.36
Challenge Information:
Implement the Tower of Hanoi Algorithm - Implement the Tower of Hanoi Algorithm