| 000 | 01678nam a22003133a 4500 | ||
|---|---|---|---|
| 001 | UPMIN-00005017251 | ||
| 003 | UPMIN | ||
| 005 | 20230202171407.0 | ||
| 008 | 230202b |||||||| |||| 00| 0 eng d | ||
| 040 |
_aDLC _cUPMin _dupmin |
||
| 041 | _aeng | ||
| 090 | 0 |
_aLG993.5 2010 _bA64 M66 |
|
| 100 |
_aMontero, Jasper S. _92083 |
||
| 245 |
_aAlgorithm generation for Rubik's cube via group theory for blindfold cubing / _cJasper S. Montero |
||
| 260 | _c2010 | ||
| 300 | _a41 leaves | ||
| 500 | _aThesis, Undergraduate (BS Applied Mathematics - Operations Research) - U.P. Mindanao | ||
| 520 | 3 | _aThis paper uses the permutation theory which closely related to Rubik's cube. The study aims to generate algorithms to be used in solving a Rubik's cube blindfolded. The method was a variation of the blindfold method discussed by Makisumi (2008) which used mainly 3 cycle algorithms. Concepts in group theory namely commutator, conjugation and order of the permutation were used in algorithm generation. Algorithm generation was done using trial and error method. Criteria were made to identify which generated algorithms were useful in blindfold cubing. Some algorithms generated in this study performed much better than some algorithms discussed by Makisumi (2008). Algorithms generated were then tested on a scrambled state of the cube. | |
| 650 | 1 | 7 |
_aBlindfold cubing _92084 |
| 650 | 1 | 7 |
_aRubik's cube _92085 |
| 650 | 1 | 7 |
_a3-cycle method _92086 |
| 650 | 1 | 7 |
_aConjugation _92087 |
| 650 | 1 | 7 |
_aCommutator _92088 |
| 650 | 1 | 7 |
_aOrder of a permutation _92089 |
| 658 |
_aUndergraduate Thesis _cAMAT200, _2BSAM |
||
| 905 | _aFi | ||
| 905 | _aUP | ||
| 942 |
_2lcc _cTHESIS |
||
| 999 |
_c2488 _d2488 |
||