A characterization of achievable patterns of the MN-puzzle problem
- 15 Downloads
One important MN-puzzle problem is to find a sequence of up-down and right-left movements of the empty-cell so that a goal-pattern can be achieved from a given initial-pattern. The second problem is to characterize the totality of the goal-pattern from a given initial-pattern. The third problem is finding the fewest movements to achieve it. In this paper, these problems will be completely solved.
KeywordsEmpty Cell Closed Path Goal Configuration Achievable Pattern Initial Data Base
Unable to display preview. Download preview PDF.
- Marshall Hall, Jr, The Theory of Groups, The Macmillan Co., 1959.Google Scholar
- N.J. Nilsson, Principles of Artificial Intelligence, Tiogo Publising Co., 1980.Google Scholar
- P.H. Wiston, Artificial Intelligence, Addison-Wesley, 1977.Google Scholar
- H. Dudeney, The Canterbury Puzzles, Dover Publications, 1958.Google Scholar
- W. Ball, Mathematical Recreations and Essays, Macmillan And Co., 1931.Google Scholar
- H. Dudeney, Puzzles and Curious Problems, edited by M. Gardner, Charles Scribner’s Sons, 1967.Google Scholar
- M. Gardner, The Scientific American Book of Mathematical Puzzles and Diversions, Simon and Schuster, 1961.Google Scholar
- M. Gardner, The Second Scientific American Book of Mathematic Puzzles and Dicersions, Simon and Schuster, 1961.Google Scholar
- W.A. Wickelgren, How to Solve Problems, W.H. Freeman, 1974.Google Scholar
- Neal H. Mccoy, Introduction to Modern Algebra, Allyn and Bacon, Inc., 1975.Google Scholar