Home Chemistry Physics Mathematics Bio Chemistry Plant Biology Aerodynamics Zoology Energy Science Product Science Science Experiments Kids Projects Contact Us

# Efficient Algorithm Solving Alexander Star

The Objective

To identify the most efficient algorithm in terms of time and number of moves (rotations of 72 degrees upon the puzzle's twelve axes of rotation) required to solve the twisty puzzle Alexander's Star (the ultimate configuration). This could ultimately be applied to handle configurations of software and data on computers.

Methods/Materials

Alexander's Star is manually subjected to two algorithms Optimal solution and God's Algorithm, with one trial for each algorithm consisting of 15 tests each. The puzzle's configuration is randomized before each test (in order to avoid the repitision of results). Materials: written algoriths; stop watch; alexander's star puzzle; data log to record results.

Results

OPTIMAL (TRIAL 2) RAW DATA 1/18/2008

Mental reasoning(control ) 3 48.18 67

Time moves

Mean 4 08.89733333333333333 71.93333333

Median 4 29.82 71

Mode none 69

Range 54.66 22

SUBJECTION OF ALEXANDER'S STAR TO GOD'S ALGORITHM RAW DATA

Mental reasoning(control ) 3 48.18 67

Time moves

MEAN 3 26.096 55

MEDIAN 3 34.91 54

MODE NONE 57

RANGE 1 05.28 29.

Conclusions/Discussion

Generally all of the ultimate configurations generated by Gods algorithm were the most efficient in terms of times to moves and the applicability. Then the traditional logical reasoning method (the control )and finally the optimal solution was the least efficient in terms of moves to time and was a bit more challenging or cumbersome to apply (hence generating ultimate configurations in a greater allotment of time) and generally the most frivolous. In short my hypothesis was supported through all examinations.

To ultimately find the most efficient algorithm in terms of times and moves to solve the Rubik's puzzle Alexander's Star.

Science Fair Project done By Diego Crespo