Skip to main content
Log in

Subgoal Strategies for Solving Board Puzzles

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

We show that a few simple search strategies can solve a variety of difficult puzzles ranging from the 15-puzzle to central solitaire, Rubik’s cube, and several of its variants. One of these strategies automatically generates subgoals; another finds efficient sets of rules for the subgoals. The subgoals are based on the reversal of simple logical implications. With these strategies and a simple learning algorithm, we not only solve particular instances of these problems but automatically generate programs that solve all instances of the problem with reasonable efficiency. Our automatically generated program for Rubik’s cube can solve a fully scrambled cube in about two minutes on a 66 Mhz 486 PC.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Berlekamp, E., Conway, J., and Guy, R., Winning Ways for Your Mathematical Plays, vol. 2, Academic Press, New York, 1982.

    Google Scholar 

  2. Dudeney, H., Amusements in Mathematics, Dover Publications, New York, 1958.

    Google Scholar 

  3. Gardner, M. (editor), Mathematical Puzzles of Sam Loyd, Dover Publications, New York, 1959.

    Google Scholar 

  4. Hentzel, I., ‘Triangular puzzle peg', J. Recreational Mathematics 6 (1973), 280–283.

    Google Scholar 

  5. Huang, G., ‘Using OTTER and Prolog to solve TopSpin', Assoc. for Automated Reasoning Newsletter 33 (1996), 3.

    Google Scholar 

  6. Huang, G., Automated Reasoning and Machine Learning, Ph.D. thesis, University of Hawaii, 1996.

  7. Johnson, W., ‘Notes on the ‘15’ puzzle', Amer. J. Math. 2 (1879), 397–399.

    Google Scholar 

  8. Koza, J., Genetic Programming: On the Programming of Computers by Natural Selection, MIT Press, Cambridge, Mass, 1992.

    Google Scholar 

  9. Lee, S. and Plaisted, D., ‘Eliminating duplication with the hyper-linking strategy', J. Automated Reasoning 9(1) (1992), 25–42.

    Google Scholar 

  10. McCune, W., OTTER 3.0 Reference Manual and Guide, Technical Report ANL-94/6, Argonne National Laboratory, Argonne, Ill, 1994.

    Google Scholar 

  11. Reiss, M., ‘Beitrage zur Theorie der Solitär-Spiels', Crelle's J. 54 (1857), 344–379.

    Google Scholar 

  12. Socher-Ambrosius, R., ‘How to avoid the derivation of redundant clauses in reasoning systems', J. Automated Reasoning 9(1) (1992), 77–97.

    Google Scholar 

  13. Stewart, I., ‘Mathematical recreations', Sci. Amer. 3 (1995), 108–110.

    Google Scholar 

  14. Story, W., ‘Notes on ‘15’ puzzle', Amer. J. Math. 2 (1879), 399–404.

    Google Scholar 

  15. Veroff, R. and Wos, L., ‘The linked inference principle, I: The formal treatment', J. Automated Reasoning 8(2) (1992), 213–274.

    Google Scholar 

  16. Wos, L., Overbeek, R., Lusk, E., and Boule, J., Automated Reasoning: Introduction and Applications, 2nd ed., McGraw-Hill, New York, 1992.

    Google Scholar 

  17. Wos, L., Veroff, R., Smith, B., and McCune, W., ‘The linked inference principle II: The user's view’, Proceedings of the 7th International Conference on Automated Deduction, Lecture Notes in Computer Science, vol. 170, ed. R. Shostak, Springer-Verlag, New York, 1984, pp. 316–332.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huang, G., Myers, D. Subgoal Strategies for Solving Board Puzzles. Journal of Automated Reasoning 20, 215–253 (1998). https://doi.org/10.1023/A:1005882724254

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1005882724254

Navigation