User contributions for Kenneth
From Speedsolving.com Wiki
29 September 2008
- 07:0907:09, 29 September 2008 diff hist +28 CxLL H R →EG
27 September 2008
- 16:2616:26, 27 September 2008 diff hist +20 CxLL H →CF / 2x2x2
- 16:2516:25, 27 September 2008 diff hist +36 CxLL aS O →CF / 2x2x2
- 16:2416:24, 27 September 2008 diff hist +40 CxLL S O →CF / 2x2x2
- 16:2216:22, 27 September 2008 diff hist +20 CxLL L O →CF / 2x2x2
- 16:2216:22, 27 September 2008 diff hist +20 CxLL T O →CF / 2x2x2
- 16:2116:21, 27 September 2008 diff hist +20 CxLL U O →CF / 2x2x2
- 16:2016:20, 27 September 2008 diff hist +77 CxLL R →Ortega / Guimond / EG
- 16:1416:14, 27 September 2008 diff hist +91 CxLL R →CF / 2x2x2
- 16:1316:13, 27 September 2008 diff hist −3 m CxLL D →Ortega / Guimond / EG
- 16:1216:12, 27 September 2008 diff hist +2 CxLL D →Ortega / Guimond EG
- 16:1216:12, 27 September 2008 diff hist +192 CxLL D →CF / 2x2x2
- 14:1814:18, 27 September 2008 diff hist +93 CxLL →Links:
- 14:0714:07, 27 September 2008 diff hist +901 N CxLL aS L YYYYYYYYYES!! the last one =
- 14:0314:03, 27 September 2008 diff hist +902 N CxLL S B New page: == S B == The classic Niklas. <br><hr> {| || 128px| | valign="top"| As for all Sune cases you look for two sticker of opposite colours in the U-face and then f...
- 13:5813:58, 27 September 2008 diff hist +907 N CxLL aS R New page: == -S R == ... <br><hr> {| || 128px| | valign="top"| As for all Sune cases you look for two sticker of opposite colours in the U-face and then find at least one mor...
- 13:5513:55, 27 September 2008 diff hist −2 m CxLL S F →S F
- 13:5413:54, 27 September 2008 diff hist 0 CxLL S F →S F
- 13:5313:53, 27 September 2008 diff hist +2 CxLL S F →S F
- 13:5013:50, 27 September 2008 diff hist +914 N CxLL S F New page: == S F == ... <br><hr> {| || 128px| | valign="top"| As for all Sune cases you look for two sticker of opposite colours in the U-face and then find at least one mor...
- 13:4313:43, 27 September 2008 diff hist +15 CxLL aS F →-S F
- 13:4113:41, 27 September 2008 diff hist +15 CxLL S R →S R
- 13:2313:23, 27 September 2008 diff hist +143 CxLL Pi B No edit summary
- 13:1613:16, 27 September 2008 diff hist +990 N CxLL aS B New page: == -S B == ... <br><hr> {| || 128px| | valign="top"| As for all Sune cases you look for two sticker of opposite colours in the U-face and then find at least one mor...
- 13:0613:06, 27 September 2008 diff hist +978 N CxLL S L New page: == S L == ... <br><hr> {| || 128px| | valign="top"| As for all Sune cases you look for two sticker of opposite colours in the U-face and then find at least one mor...
- 12:5712:57, 27 September 2008 diff hist +51 CxLL S R No edit summary
- 12:5212:52, 27 September 2008 diff hist +885 N CxLL aS F New page: == -S F == ... <br><hr> {| || 128px| | valign="top"| As for all Sune cases you look for two sticker of opposite colours in the U-face and then find at least one mor...
- 12:4512:45, 27 September 2008 diff hist +834 N CxLL S R New page: == S R == ... <br><hr> {| || 128px| | valign="top"| As for all Sune cases you look for two sticker of opposite colours in the U-face and then find at least one mor...
- 09:4409:44, 27 September 2008 diff hist +537 N CxLL T B New page: == T B == ... <br><hr> {| || 128px| | valign="top"| As for all T cases you look at two "bars" of stickers, one at Fur-Ful and one at Urb-Ulb. In this case the bar a...
- 09:2809:28, 27 September 2008 diff hist +2 CxLL U B →CLL
- 09:2709:27, 27 September 2008 diff hist +62 CxLL U B →CLL
- 09:2509:25, 27 September 2008 diff hist +689 CxLL U B No edit summary
- 09:1109:11, 27 September 2008 diff hist +3,892 N COLL U B CubeX Algorithms New page: Here is a list of all 13 turn algorithms for the case COLL U B, no shorter algs are to be found, for 2x2x2 and CF this is one of the 11 turn cases but you can do in 10 + [[AUF...
- 09:0409:04, 27 September 2008 diff hist +29 Nm CxLL U B New page: COLL U B CubeX Algorithms
- 07:0807:08, 27 September 2008 diff hist −2 m CxLL U F →COLL
- 07:0807:08, 27 September 2008 diff hist +5 CxLL U F →CMLL
- 07:0707:07, 27 September 2008 diff hist +5 m CxLL T F No edit summary
- 07:0607:06, 27 September 2008 diff hist +661 N CxLL T F New page: == T F == This case and the case U F are inverses of each other so the same algorithm (9 move commutator or mirror) can be used to solve both. <br><hr> {| || [[image:CxLL T F...
- 06:5806:58, 27 September 2008 diff hist +700 N CxLL U F New page: == U F == This case and the case T F are inverses of each other so the same algorithm (9 move commutator or mirror) can be used to solve both. <br><hr> {| || [[image:CxLL U F...
26 September 2008
- 20:2720:27, 26 September 2008 diff hist 0 CxLL L R →L R
- 20:2620:26, 26 September 2008 diff hist 0 CxLL L B →L B
- 20:2320:23, 26 September 2008 diff hist +27 CxLL L B No edit summary
- 20:2320:23, 26 September 2008 diff hist +27 CxLL L R No edit summary
- 20:2320:23, 26 September 2008 diff hist +26 CxLL T L No edit summary
- 20:2220:22, 26 September 2008 diff hist −1 CxLL T R No edit summary
- 20:2120:21, 26 September 2008 diff hist +1 CxLL L R →L R
- 20:2120:21, 26 September 2008 diff hist +587 N CxLL L B New page: == L B == The four cases, T R, T L, L R and L B are mirrors and inverses of each other so the same algorithm (8 move commutator) can be ...
- 20:2020:20, 26 September 2008 diff hist +583 N CxLL L R New page: == L R == The four cases, T R, T L, L R and L B are mirrors and inverses of each other so the same algorithm (8 move commutator) can be ...
- 20:1420:14, 26 September 2008 diff hist +1 CxLL T L →COLL
- 20:1420:14, 26 September 2008 diff hist +5 CxLL T R →COLL
