840Re: Chapter 3 discussion
- Sep 24, 2008--- In email@example.com, "kiana" <blacksilk79@...> wrote:
> I understand the material in the chapter. However, the exercises
> completely confusing to me. Therefore, a discussion of the chaptermay
> clarify. For the 8-puzzle problem, I am not able to understand thestate
> existence of two disjoint sets of all possible states in which a
> from one set can't transform to a state in the other set by anynumber
> of moves. I would assume any state can be reached by in otherstate. In
> other words, there are situations (initial state - goalconfiguration)
> in which the puzzle isn't solvable? Does the two disjoint sets exitI'm confused, any clarification is greatly appreciated.
> because the problem becomes an NP-Complete problem for those states
> trying to reach the states in the other disjoint set. And, the 9!/2
> calculation for all possible states derives from this theorem of
> exactly half of the possible states transform into a given goal, is
> this true?
- << Previous post in topic Next post in topic >>