Subgoal Strategies for Solving Board Puzzles

Authors:
Guoxiang Huang;Dale Myers
Affiliations:
Mathematics Department, University of Hawaii, Honolulu, HI 96822-2273 URL: http://www.math.hawaii.edu/ $∼$ dale/goal/;Mathematics Department, University of Hawaii, Honolulu, HI 96822-2273 URL: http://www.math.hawaii.edu/ $∼$ dale/goal/
Venue:
Journal of Automated Reasoning
Year:
1998

Citing 5
Cited 0

Automated reasoning (2nd ed.): introduction and applications

Automated reasoning (2nd ed.): introduction and applications
Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
The linked inference principle, I.: the formal treatment

Journal of Automated Reasoning
Automated reasoning and machine learning

Automated reasoning and machine learning
The Linked Inference Principle, II: The User's Viewpoint

Proceedings of the 7th International Conference on Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

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