If all else fails, you could search through all partitions of N-1 to find the best subproblem split, but that's no fun ;)
blokhead
In reply to Re^3: Best possible counts for a few test cases (in readmore) (Hanoi Challenge)
by blokhead
in thread Hanoi Challenge
by tilly
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |