Browse Groups

• ... are ... may ... state ... number ... state. In ... configuration) ... Discussions of the topics in the book leads to a better understanding of the
Message 1 of 3 , Sep 24, 2008
View Source
--- In aima-talk@yahoogroups.com, "kiana" <blacksilk79@...> wrote:
>
> I understand the material in the chapter. However, the exercises
are
> completely confusing to me. Therefore, a discussion of the chapter
may
> clarify. For the 8-puzzle problem, I am not able to understand the
> existence of two disjoint sets of all possible states in which a
state
> from one set can't transform to a state in the other set by any
number
> of moves. I would assume any state can be reached by in other
state. In
> other words, there are situations (initial state - goal
configuration)
> in which the puzzle isn't solvable? Does the two disjoint sets exit
> 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?
>
Discussions of the topics in the book leads to a better understanding
of the material. I need clarification of the topics in order to
order for me to understand the material further, I need to understand
the questions. The existence of the disjoint sets were discussed in
book, so I would like to elaborate on that topic. I don't understand
that section of the book. Thank you.
• ... are ... may ... state ... number ... state. In ... configuration) ... I m confused, any clarification is greatly appreciated.
Message 2 of 3 , Sep 24, 2008
View Source
--- In aima-talk@yahoogroups.com, "kiana" <blacksilk79@...> wrote:
>
> I understand the material in the chapter. However, the exercises
are
> completely confusing to me. Therefore, a discussion of the chapter
may
> clarify. For the 8-puzzle problem, I am not able to understand the
> existence of two disjoint sets of all possible states in which a
state
> from one set can't transform to a state in the other set by any
number
> of moves. I would assume any state can be reached by in other
state. In
> other words, there are situations (initial state - goal
configuration)
> in which the puzzle isn't solvable? Does the two disjoint sets exit
> 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?
>
I'm confused, any clarification is greatly appreciated.
Your message has been successfully submitted and would be delivered to recipients shortly.
• Changes have not been saved
Press OK to abandon changes or Cancel to continue editing
• Your browser is not supported
Kindly note that Groups does not support 7.0 or earlier versions of Internet Explorer. We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox. If you are using IE 9 or later, make sure you turn off Compatibility View.