Talk:Sussman anomaly

Untitled
The problem description seems to be lacking. Onto what positions can the blocks be moved? If they can go anywhere on the table, the problem is trivial to solve (unstack C from A, stack B onto C, then A onto B). If you can only use the two already formed stacks, the problem has no solution. 188.15.228.171 (talk) 07:59, 3 March 2017 (UTC)

20200301 Are there better examples of the anomaly? This one seems to depend on a really poor division of the goal into subgoals: it omits the subgoal "Put C upon the table" which is certainly part of the overall goal. If this were included there would be no difficulty in finding the sequence of subgoal satisfactions that would achieve the overall goal. — Preceding unsigned comment added by 67.193.196.160 (talk) 04:18, 2 March 2020 (UTC)