We present a series of experiments in which human subjects were tested with a well-known combinatorial problem called the15-puzzle and in different-sized variants of this puzzle. Subjects can solve these puzzles reliably by systematically building a solution path, without performing much search and without using distances among the states of the problem. The computational complexity of the underlying mental mechanisms is very low. We formulated a computational model of the underlying cognitive processes on the basis of our results. This model applied a pyramid algorithm to individual stages of each problem. The model’s performance proved to be quite similar to the subjects’ performance. Partial support for this research was provided by the Air Force Office of Scientific Research.
Bartlett, F. C. (1958).Thinking: An experimental and social study. London: Allen & Unwin.
Bouman, C., &Liu, B. (1991). Multiple resolution segmentation of textured images.IEEE Transactions on Pattern Analysis & Machine Intelligence,13, 99–113.
Cowan, N. (2001). The magical number 4 in short-term memory: A consideration of mental storage capacity.Behavioral & Brain Sciences,24, 87–185.
Garey, M. R., &Johnson, D. S. (1979).Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman.
Graham, S. M., Joshi, A., &Pizlo, Z. (2000). The traveling salesman problem: A hierarchical model.Memory & Cognition,28, 1191–1204.
Gutin, G., &Punnen, A. P. (2002).The traveling salesman problem and its variations. Boston: Kluwer.
Jolion, J.-M., &Rosenfeld, A. (1994).A pyramid framework for early vision: Multiresolutional computer vision. Dordrecht: Kluwer.
Korf, R. E. (1985). Depth-first iterative-deepening: An optimal admissible tree search.Artificial Intelligence,27, 97–109.
Kropatsch, W. G., Leonardis, A., &Bischof, H. (1999). Hierarchical, adaptive, and robust methods for image understanding.Surveys on Mathematics for Industry,9, 1–47.
Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., &Shmoys, D. B. (1985).The traveling salesman problem: A guided tour of combinatorial optimization. New York: Wiley.
MacGregor, J. N., &Ormerod, T. (1996). Human performance on the traveling salesman problem.Perception & Psychophysics,58, 527–539.
Maier, N. R. F. (1930). Reasoning in humans: On direction.Journal of Comparative Psychology,10, 115–143.
Metcalfe, J., &Wiebe, D. (1987). Intuition in insight and noninsight problem solving.Memory & Cognition,15, 238–246.
Newell, A., &Ernst, G. (1965). The search for generality. In W. A. Kalenich (Ed.),Information processing: Proceedings of IFIP Congress (Vol. 1, pp. 17–24). Washington, DC: Spartan.
Nilsson, N. J. (1971).Problem-solving methods in artificial intelligence. New York: McGraw-Hill.
Nilsson, N. J. (1980).Principles of artificial intelligence. Palo Alto, CA: Morgan Kaufmann.
O’Hara, K. P., &Payne, S. J. (1998). The effects of operator implementation cost on planfulness of problem solving and learning.Cognitive Psychology,35, 34–70.
Pizlo, Z., &Li, Z. (2003). Pyramid algorithms as models of human cognition. In C. A. Bouman & R. L. Stevenson (Eds.),Computational imaging (Proceedings of SPIE-IS&T Conference on Electronic Imaging, Vol. 5016, pp. 1–12). Bellingham, WA: SPIE.
Pizlo, Z., &Li, Z. (2004). Graph pyramids as models of human problem solving. In C. A. Bouman & E. L. Miller (Eds.),Computational imaging II (Proceedings of the SPIE-IS&T Conference on Electronic Imaging, Computational Imaging, Vol. 5299, pp. 205–215). Bellingham, WA: SPIE.
Pizlo, Z., Rosenfeld, A., &Epelboim, J. (1995). An exponential pyramid model of the time-course of size processing.Vision Research,35, 1089–1107.
Pizlo, Z., Salach-Golyska, M., &Rosenfeld, A. (1997). Curve detection in a noisy image.Vision Research,37, 1217–1241.
Ratner, D., &Warmuth, M. K. (1986).Finding a shortest solution for then × n extension of the 15-puzzle is intractable. Proceedings of the Fifth National Conference on Artificial Intelligence (Vol. 1, pp. 168–172). San Mateo, CA: Morgan Kaufmann.
Richards, W., &Koenderink, J. J. (1995). Trajectory mapping: A new nonmetric scaling technique.Perception,24, 1315–1331.
Rosenfeld, A., &Thurston, M. (1971). Edge and curve detection for visual scene analysis.IEEE Transactions on Computers,C-20, 562–569.
Russell, S. J., &Norvig, P. (1995).Artificial intelligence. A modern approach. Upper Saddle River, NJ: Prentice-Hall.
Schofield, P. D. A. (1967). Complete solution of the eight puzzle. In E. Dale & D. Michie (Eds.),Machine intelligence (Vol. 2, pp. 125–133). New York: Elsevier.
Shepard, R. N. (1962). The analysis of proximities: Multidimensional scaling with an unknown distance function. Part I.Psychometrika,27, 125–140.
Tolman, E. C., Ritchie, B. F., &Kalish, D. (1946). Studies in spatial learning: I. Orientation and the short-cut.Journal of Experimental Psychology,36, 13–24.
Vickers, D., Lee, M. D., Dry, M., &Hughes, P. (2003). The roles of the convex hull and the number of potential intersections in performance on visually presented traveling salesperson problems.Memory & Cognition,31, 1094–1104.
Weisstein, E. W. (2003).CRC concise encyclopedia of mathematics. New York: Chapman & Hall.
Partial support for this research was provided by the Air Force Office of Scientific Research.
About this article
Cite this article
Pizlo, Z., Li, Z. Solving combinatorial problems: The 15-puzzle. Memory & Cognition 33, 1069–1084 (2005). https://doi.org/10.3758/BF03193214
- Reference State
- Travel Salesman Problem
- Goal State
- Combinatorial Problem
- Solution Path