A SOLUTION TO THE SCHEDULING PROBLEM IN 9-LATT1CE
Xiuli Chao · Chinese Journal of Computers · 1983
This problem has been discussed in many books concerning artificial intelligence and design of computer algorithms. It is also called an 8-puzzle problem. But it is not cleat up to now whether any initial configuration can be changed into a goal configuration by means of finite shift. As a matter of fact, the problem is not always solvable. Only a half of the 9! initial configurations can be come goal configurations, while the rest can not. This paper illustrates such a conclusion and gives an algorithm for the solution.