It has been observed that in many of the benchmark planning domains, atomic goals can be reached with a simple polynomial exploration procedure, called IW, runs time exponential problem width. Such problems have indeed bounded width: width does not grow number variables and is often no greater than two. Yet, while notion become part state- of-the-art algorithms like BFWS, there still good expla...