Question: Show that the 8-puizle states are divided into two disjoint sets, such that no state in one set can be transformed into a state in
Show that the 8-puizle states are divided into two disjoint sets, such that no state in one set can be transformed into a state in the other set by any number of moves. Devise a procedure that will tell you which class a given state is in, and explain why this is a good thing to have for generating random states.
Step by Step Solution
3.43 Rating (156 Votes )
There are 3 Steps involved in it
From httpwwwcuttheknotcompvthagorasfifteenshtml this proof applies to the fifteen puzzles but the same argument works for the eight puzzles Definition ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
21-C-S-A-I (27).docx
120 KBs Word File
