<hanoi.awl> {


Towers of Hanoi: 5 disks...

	#1: A => B
	#2: A => C
	#1: B => C
	#3: A => B
	#1: C => A
	#2: C => B
	#1: A => B
	#4: A => C
	#1: B => C
	#2: B => A
	#1: C => A
	#3: B => C
	#1: A => B
	#2: A => C
	#1: B => C
	#5: A => B
	#1: C => A
	#2: C => B
	#1: A => B
	#3: C => A
	#1: B => C
	#2: B => A
	#1: C => A
	#4: C => B
	#1: A => B
	#2: A => C
	#1: B => C
	#3: A => B
	#1: C => A
	#2: C => B
	#1: A => B

Puzzle solved for: 31 steps.

} <hanoi.awl> #26 / [2]