3 ms·
This solves the problem by searching the graph of reachable states (and presumably doing cycle detection, at least in depth-first mode), which avoids the proble
by mannykannot 9y ago
This solves the problem by searching the graph of reachable states (and presumably doing cycle detection, at least in depth-first mode), which avoids the problem of picking an unsuitable sub-goal by considering all possible ones. While this is a perfectly good solution, it doesn't seem to throw much light on how human intelligence works. A person is likely to notice, for example, that extending any stack that does not have C on the bottom is not helpful, without mentally running through all possibilities, but just on the basis that it will have to be torn down at some point, to move the bottom block to where it belongs.
- CarolineW 9y agoIt also just "blows up" on any problem of any real complexity, and as such isn't really a solution.
- adrianratnapala 9y agoOf course human intelligence also stumbles on planing problems of true complexity. So it is still possible that human intelligence does something like a naive graph search, and this is good enough in the common case.
- mannykannot 9y agoI do not think naive search would give rise to the sort of reasoning that I posit in my initial post, even as a post-facto rationalization rather than as part of actually solving the problem.