 |
A.I. Puzzler |
 |
The A.I. Puzzler is a program that teaches itself to solve the Rubik's
cube using cased-based search. There is ongoing work to expand the
Puzzler to solve other puzzles and to minimize the help given in the
form of hard-coded heuristics.
Goals
The goal of this project is to write a program that will develop an
efficient algorithm to solve the Rubik's Cube given any legal starting
state, and to then expand the class of puzzles that A.I. Puzzler can
solve and minimize the help given (in the form of heuristics). In
particular, the Puzzler should eventually start with no more knowledge
about the puzzles than their basic mechanics.
To achieve this goal, a variety of other puzzles similar to the
Rubik's Cube will need to be studied in depth, to simulate their
behavior computationally, and as a basis for algorithm development and
testing. In particular, A.I. Puzzler will attempt to learn algorithms
for a number of group-based (highly symmetric) puzzles, as well as a
few non-group-based (asymmetric) puzzles.
This site was last updated Saturday, 26 February 2005, at 1:34 AM.