denotes number disks moved h denotes home rod denotes target rod ht denotes third rod neither h denotes concatenation n h solution problem consisting n disks moved rod h rod n problem trivial namely ht move disk rod h rod one disk left number moves required solution sup ''n'' sup nbsp minus nbsp objective '''maximize''' number moves
Applied science Transportation Operations research Dynamic programming