Electronic Resource
Springer
Journal of automated reasoning
20 (1998), S. 215-253
ISSN:
1573-0670
Keywords:
automated deduction
;
subgoal
;
puzzle
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1005882724254
Permalink
|
Location |
Call Number |
Expected |
Availability |