Source tower has odd disks? Move top piece to destination tower. Otherwise, move it to the top of the off tower. Always move the largest disk you can that wasn’t placed in your previous move.
Consider a tower of three, moving from the left to right:
321 / - / -
32 / - / 1
3 / 2 / 1
Next, 1 should be moved to the center position on top of two for the optimal solution, but your ruleset has no indicator of which choice should be made.
For each tower of size N, move tower (N - 1) to the non-target position, then move the base to the target position, then move the previously moved tower of size (N - 1) to the target position.
Source tower has odd disks? Move top piece to destination tower. Otherwise, move it to the top of the off tower. Always move the largest disk you can that wasn’t placed in your previous move.
These instructions seem incomplete.
Consider a tower of three, moving from the left to right:
321 / - / -
32 / - / 1
3 / 2 / 1
Next, 1 should be moved to the center position on top of two for the optimal solution, but your ruleset has no indicator of which choice should be made.
You’re right, how can we simplify that into a usable insite?
For each tower of size N, move tower (N - 1) to the non-target position, then move the base to the target position, then move the previously moved tower of size (N - 1) to the target position.