This generates optimal solutions to Blocks World problems with completely specified initial and goal states. You must supply the problem by typing or pasting it into the text boxes below. The optimal solutions can be used in experiments, for instance to measure the solution quality of some suboptimal planner.
The input format for each state of N blocks is simply a list of N integers in the range [0 ...N], separated by white space. The i-th of these numbers represents the block that the i-th block is on, or the table if it is 0
An error will be reported if either of the states is the wrong size, or if two blocks are on the same block, or if one of the numbers is out of range.
Example: three blocks. Initially blocks 1 and 2 are on the table and block 3 is on block 1. In the goal, block 2 is on the table, block 1 on top of it and block 3 again on block 1.
initial state:
0 0 1
goal state:
2 0 1
If you want to generate the problems randomly, you need this page instead.
Note: If you report experiments using this page, please note that the correct citation is the paper:
John Slaney and Sylvie Thiébauxin which the optimal solver and associated theory are fully described.
Blocks World revisited
Artificial Intelligence 125 (2001): 119-153.