The following is and example of a planning algorithm. The user may drag and drop the stacks of blocks in the Source and Destination areas. When the Solve button is click the algorithm will run to calculate the sequence of moves needed to move the blocks in the Source section to the positions in the Destination by only stacking and unstacking blocks.
When the Build button is clicked the computed steps are graphically executed.
Notes: The Steps must be solved before it can be built. The algorithm can only be run once before the page must be refreshed.