

![0_image_0.png](0_image_0.png)

## 8.6.6 Hanoi

![0_image_1.png](0_image_1.png)

We ran the planners in 6 *hanoi* problems, taken by Bonet and Geffner (2001). The six problems have three to eight disks respectively. Figure 21 presents the results.