I searched PerlMonks for towers of hanoi, but couldn't find anything. It is strange because there isn't any good reason not to golf this game. Since I'm not good at golf, I can provide only Ton Hospel's two solutions to the problem.

perl -wle 'print log(~$_&($_+1))/log 2 for 0..2**pop()-2' 3 perl -wle '$n=-1+2**pop;print log($n--&~$n)/log 2while$n' 3
It tells which disk to move for 3 disks. Replace the 3 at the end for the other numbers up to 32. There's always only one possibility since top disk goes where it has not been yet. Unfortunatelly it works only under 32.

<-- z0d -->