Speedsolving.com Wiki - User contributions [en]

User talk:Kenneth

2008-10-08T18:00:02Z

Quadrescence: /* Deleting the picture */ new section

Your CxLL project is a great idea. I'll help out when I can. Good luck with it. --[[User:Kirjava|Kirjava]] 01:26, 15 September 2008 (UTC)

:Thank's Thom, hope you can add up CMLL because I don't know that many algs for it // [[User:Kenneth|Kenneth]] 06:01, 15 September 2008 (UTC)

== Request ==

Sounds like a good idea. If we made it so everyone could delete pages, that may get out of hand. Perhaps if we can undo deletion of pages, it wouldn't be that bad. I will see what I can do soon. This week and upcoming weekend will be very busy, but I will get to it ASAP. Great work so far, Kenneth.

How about making it so only registers users can delete pages? I think you can undo this anyway... --[[User:Kirjava|Kirjava]] 12:18, 16 September 2008 (UTC)

== --- ==

I'll try setting that up soon.
-[[User:WikiAdmin|WikiAdmin]]

== -- ==

Sorry about that. Fixed now. I was messing around with making TeX work, and apparently messed with the image paths. Thanks for letting me know.

== Deleting the picture ==

I did it because this wiki is very unencyclopedic at the moment, and I was doing cleaning up.

An image should not be in the heading of a section, and I did not find it at all appropriate.

Roux method

2008-10-06T00:02:56Z

Quadrescence: /* Cons */

The '''Roux Method''' was invented by [[Gilles Roux]]. Unlike [[Fridrich]] and [[Petrus]], the inventor of this method has done a sub-15 second average (of 5) with it in competition.

==The Steps==

1. Build a 1x2x3 block anywhere on the cube.

2. Build a second 1x2x3 block opposite of the first 1x2x3 block, without disrupting the first 1x2x3 block. After this step, there should be two 1x2x3 blocks: one on the lower left side, and one lower right side, leaving the U slice and M slice free to move.

3. Simultaneously [[orient]] and [[permute]] the remaining 4 corners on the top layer (U-slice). You can use [[CMLL]] or [[COLL]] to do this.

4. [[Orient]] the 6 remaining edges (UF, UB, UF, UR, DF, DB need to be oriented correctly).

5. Solve the left and right layer edges. After this step, both the left and right side layers should be complete.

6. Solve the centers and edges in the M slice.

''See also: [[E15]]''

==Pros==

Like the Petrus method, the Roux method uses fewer moves than the popular Fridrich method. It is also more intuitive and requires fewer algorithms.

==Cons==

Block building can be difficult for a beginner to get used to. The reliance on r and M moves may also be difficult for some people, so much so that cubers who have trouble with M turns should probably not use this as their main method. Slice turns can also be slower than using a [[quarter-turn metric]].

==Where to learn the Roux Method==

* [http://grrroux.free.fr/method/Intro.html Gilles Roux's tutorial]

[[Category:3x3x3 methods]]

List of PC cubing software

2008-10-05T23:58:33Z

Quadrescence: /* Solvers */

== Description ==
A very popular category of Rubik's cube software is the playable 3D Rubik's Cube (animated cube), often implemented as a Java applet, which has a long history. The first version of which many current programs are derived was made by Michael Shubart. After that, Karl Hornell made modifications in his version, which again was used by Lars Petrus on his website. Probably the most widely used is RubikPlayer by Werner Randelshofer.

== Standalone Timers ==
* [http://vanderblonk.com/cube/download/rtt/About.htm RubikTimer] - (Windows)
* [http://www.strangepuzzle.com/jnetcube.html JNetCube] - (Java)
* [http://code.google.com/p/rubiks-jtimer/ JTimer] - New version of JNetCube (Java)
* [http://vanderblonk.com/cube/cubetimer.htm CubeTimer] - Timer with animation
* [http://gnehzr.net/cct/ CALCubeTimer 0.2] - Interfaces with a stackmat through the microphone port
* [http://soft.imolecule.net/?lang=en iMolecule Soft DarkCube] - Timer in Thai and English under CC By-NC-SA 3.0 license

== Solvers ==
* [http://software.rubikscube.info/JACube/index.html ACube] - Fast solver written by Josef Jelinek, and is able to ignore pieces and specify different metrics upon loading. (Java, freeware, command-line based)
* [http://kociemba.org/cube.htm Cube Explorer] - Fast solver written by Kociemba with his algorithm (Windows, freeware, graphical)
* [http://www.geocities.com/jaapsch/puzzles/cubie.htm Cubie] - Solver with animation (Java, freeware)
* [http://www.wrongway.org/?rubik Rubik's Cube Solver by Eric Dietz] - (Windows/Linux, GPL)
* [http://www.svekub.se/files/ksolve.zip ksolve] - A general puzzle solver by Kare Krig. Uses a written definition file and scramble file, and is much slower than dedicated solvers. (Windows, freeware, command-line based)
* [http://www.ganpuzzle.com/vcube333demo.htm Learn to Solve Rubik's Cube with 3 Simple Tricks] - Step-by-step interactive animated solution (Java)
* [http://www.ganpuzzle.com/hints3x3.htm Rubik's Solution Hints Booklet Step Animation] - Step-by-step interactive animated solution based on official booklet (Java)

== Animations ==
* [http://www.ultimatemagiccube.com Ultimate Magic Cube] - (Windows). Megaminx, pyraminx and much more
* [http://www.glidingcube.com GlidingCube] - (Windows) A virtual cube puzzle. Intriguing but cannot be built physically.
* [http://www.superliminal.com/cube/cube.htm 4D Cube] - (Java)
* [http://www.gravitation3d.com/magiccube5d/ 5D Cube] - (Windows)
* [http://sourceforge.net/projects/rubiksim/ RubikSim] - (Windows)
* [http://gabbasoft.com/ Gabbasoft] - (Windows) A collection of NxNxN puzzles 2-20, and with [[supercubes]]
* [http://www.network54.com/Forum/178387/message/1191974095/ QBASIC Rubik's Cube] - (DOS/Windows) At 26,375 bytes (25.7 KB), the smallest Rubik's cube on PC

* [http://www.leinweb.com/snackbar/cube/index.htm Hungarian HexaHedron ]- (Windows) It is amazing for FMC. Records your solution as you go.

List of PC cubing software

2008-10-05T23:54:57Z

Quadrescence: /* Standalone Timers */

== Description ==
A very popular category of Rubik's cube software is the playable 3D Rubik's Cube (animated cube), often implemented as a Java applet, which has a long history. The first version of which many current programs are derived was made by Michael Shubart. After that, Karl Hornell made modifications in his version, which again was used by Lars Petrus on his website. Probably the most widely used is RubikPlayer by Werner Randelshofer.

== Standalone Timers ==
* [http://vanderblonk.com/cube/download/rtt/About.htm RubikTimer] - (Windows)
* [http://www.strangepuzzle.com/jnetcube.html JNetCube] - (Java)
* [http://code.google.com/p/rubiks-jtimer/ JTimer] - New version of JNetCube (Java)
* [http://vanderblonk.com/cube/cubetimer.htm CubeTimer] - Timer with animation
* [http://gnehzr.net/cct/ CALCubeTimer 0.2] - Interfaces with a stackmat through the microphone port
* [http://soft.imolecule.net/?lang=en iMolecule Soft DarkCube] - Timer in Thai and English under CC By-NC-SA 3.0 license

== Solvers ==
* [http://software.rubikscube.info/JACube/index.html ACube] - (Java, freeware, command-line based)
* [http://kociemba.org/cube.htm Cube Explorer] - (Windows, freeware, comes with graphical interface)
* [http://www.geocities.com/jaapsch/puzzles/cubie.htm Cubie] - Solver with animation (Java, freeware)
* [http://www.wrongway.org/?rubik Rubik's Cube Solver by Eric Dietz] - (Windows/Linux, GPL)
* [http://www.svekub.se/files/ksolve.zip ksolve] - (Windows, freeware, command-line based)
* [http://www.ganpuzzle.com/vcube333demo.htm Learn to Solve Rubik's Cube with 3 Simple Tricks] - Step-by-step interactive animated solution (Java)
* [http://www.ganpuzzle.com/hints3x3.htm Rubik's Solution Hints Booklet Step Animation] - Step-by-step interactive animated solution based on official booklet (Java)

== Animations ==
* [http://www.ultimatemagiccube.com Ultimate Magic Cube] - (Windows). Megaminx, pyraminx and much more
* [http://www.glidingcube.com GlidingCube] - (Windows) A virtual cube puzzle. Intriguing but cannot be built physically.
* [http://www.superliminal.com/cube/cube.htm 4D Cube] - (Java)
* [http://www.gravitation3d.com/magiccube5d/ 5D Cube] - (Windows)
* [http://sourceforge.net/projects/rubiksim/ RubikSim] - (Windows)
* [http://gabbasoft.com/ Gabbasoft] - (Windows) A collection of NxNxN puzzles 2-20, and with [[supercubes]]
* [http://www.network54.com/Forum/178387/message/1191974095/ QBASIC Rubik's Cube] - (DOS/Windows) At 26,375 bytes (25.7 KB), the smallest Rubik's cube on PC

* [http://www.leinweb.com/snackbar/cube/index.htm Hungarian HexaHedron ]- (Windows) It is amazing for FMC. Records your solution as you go.

CxLL

2008-10-05T23:50:32Z

Quadrescence: fixed some stuff

'''Corners Last Layer''' is a group of methods collectively known as '''C*LL''' or '''CxLL''' that solve the last layer corners in one algorithm. Each method has certain restrictions that apply, and each can affect other pieces in different ways. For example, [[CMLL]] allows movement of the M layer and allows destruction of the UL and UR edges. Two other common sets of algorithms include [[CLL]] and [[COLL]]. These differ from the fact that the latter preserves last layer's edges orientation while the former does not necessarily. In some cases, CLL will give shorter algorithms due to lack of restrictions.

C*LL is useful for the [[2x2x2]], which has no edges, and also for [[CF|corners first]], which solves edges after the corners. C*LL is also used in [[Roux Method|Roux's method]], and is specifically known as CMLL.

== The lists ==
=== Browse ===

At bottom of each page there is a [[CxLL Algorithms#Navigator|navigator]] that you use to browse from page to page by clicking the names under the thumbnail images.

=== Case Descriptions ===

{|
| valign="top"| [[image:CxLL Stickers.jpg|96px|]]
| valign="top"| All colour patterns showed in the decriptions assumes white on top and green in front (official colour sheme). The description images divided into four quadrants makes one corner each as showed in the image to the left. The stickers showed in the images at the pages are whites for the four belonging to the U face and four more, the important recognition stickers, the rest of the stickers of the corners you can ignore in recognition, that's why those are not displayed in the images.
|}

In case descriptions there are sometimes links to the "inverse case", that is the case you get if you do N-PLL on the case you got (or faster R2 F2 R2).

=== The Algorithms ===
At each page there are list of algs for diffrent types of CxLL menthods, topmost is COLL followed by CLL, CMLL and so on. An alg suitable for COLL is always also suitable for CLL but a CLL is newer useful for COLL, if your CLL preserves LL edge orientation then it is a COLL and should be listed as that. If your alg destroys M slice edges then it is a CMLL, if it ruins F2L edges it is a CF / 2x2x2 and if it changes FL corner premutation it is a EG 0/1 alg (all levles are also useful for [[Ortega]]).

== Beginners ==
For a beginner who likes a stepping stone it is possible to do CxLL in two steps; first orientation and then permutation. In the navigator these algs are the grey cases having single letter names, orientations are in the leftmost row and permutations in the topmost line.

== Links ==
* [http://www.speedsolving.com/forum/showthread.php?t=6365 Thread discussing this CxLL page]
* [http://www.speedsolving.com/forum/showthread.php?t=6497 Thread discussing 2x2x2 algorithms]
* [http://home.comcast.net/~quadricode/hyperorientations/ Hyperorientations]: A proposed method for recognizing C*LL cases easily.

== Navigator ==
{{CxLLnav}}

CxLL

2008-10-05T23:44:02Z

Quadrescence: made it more encyclopedic

'''Corners Last Layer''' is a group of methods collectively known as '''C*LL''' or '''CxLL''' that solve the last layer corners in one algorithm. Each method has certain restrictions that apply, and each can affect other pieces in different ways. For example, [[CMLL]] allows movement of the M layer and allows destruction of the UL and UR edges. Two other common sets of algorithms include [[CLL]] and [[COLL]]. These differ from the fact that the latter preserves last layer's edges orientation while the former does not necessarily. In some cases, CLL will give shorter algorithms due to lack of restrictions.

C*LL is useful for the [[2x2x2]], which has no edges, and also for [[CF|corners first]], which solves edges after the corners. C*LL is also used in [[Roux Method|Roux's method]], and is specifically known as CMLL.

=== The lists ===
'''Browse:''' 
At bottom of each page there is a [[CxLL Algorithms#Navigator|navigator]] that you use to browse from page to page by clicking the names under the thumbnail images.

'''Case Descriptions''' 

{|
| valign="top"| [[image:CxLL Stickers.jpg|96px|]]
| valign="top"| All colour patterns showed in the decriptions assumes white on top and green in front (official colour sheme). The description images divided into four quadrants makes one corner each as showed in the image to the left. The stickers showed in the images at the pages are whites for the four belonging to the U face and four more, the important recognition stickers, the rest of the stickers of the corners you can ignore in recognition, that's why those are not displayed in the images.
|}

In case descriptions there are sometimes links to the "inverse case", that is the case you get if you do N-PLL on the case you got (or faster R2 F2 R2).

'''The Algorithms''' 
At each page there are list of algs for diffrent types of CxLL menthods, topmost is COLL followed by CLL, CMLL and so on. An alg suitable for COLL is always also suitable for CLL but a CLL is newer useful for COLL, if your CLL preserves LL edge orientation then it is a COLL and should be listed as that. If your alg destroys M slice edges then it is a CMLL, if it ruins F2L edges it is a CF / 2x2x2 and if it changes FL corner premutation it is a EG 0/1 alg (all levles are also useful for [[Ortega]]).

== Beginners ==
For a beginner who likes a stepping stone it is possible to do CxLL in two steps; first orientation and then permutation. In the navigator these algs are the grey cases having single letter names, orientations are in the leftmost row and permutations in the topmost line.

== Links: ==
* [http://www.speedsolving.com/forum/showthread.php?t=6365 Thread discussing this CxLL page]
* [http://www.speedsolving.com/forum/showthread.php?t=6497 Thread discussing 2x2x2 algorithms]
* [http://home.comcast.net/~quadricode/hyperorientations/ Hyperorientations]: A proposed method for recognizing C*LL cases easily.

==Navigator==
{{CxLLnav}}

CxLL

2008-10-05T23:32:51Z

Quadrescence: /* Links: */

The '''Corners of the Last Layer''', a group of methods that solves the last layer corners in one alg. The most common ones are [[COLL]] and [[CLL]] for the [[3x3x3]]. these differs from that COLL preseves last layer edges orientation and CLL does not. In some cases this gives shorter algs. For [[2x2x2]] that has got no edges and also for [[CF]] that solves edges after the corners are solved you can use even shorter CLL algorithms.

=== The lists ===
'''Browse:''' 
At bottom of each page there is a [[CxLL Algorithms#Navigator|navigator]] that you use to browse from page to page by clicking the names under the thumbnail images.

'''Case descriptions:''' 

{|
| valign="top"| [[image:CxLL Stickers.jpg|96px|]]
| valign="top"| All colour patterns showed in the decriptions assumes white on top and green in front (official colour sheme). The description images divided into four quadrants makes one corner each as showed in the image to the left. The stickers showed in the images at the pages are whites for the four belonging to the U face and four more, the important recognition stickers, the rest of the stickers of the corners you can ignore in recognition, that's why those are not displayed in the images.
|}

In case descriptions there are sometimes links to the "inverse case", that is the case you get if you do N-PLL on the case you got (or faster R2 F2 R2).

'''The algs:''' 
At each page there are list of algs for diffrent types of CxLL menthods, topmost is COLL followed by CLL, CMLL and so on. An alg suitable for COLL is always also suitable for CLL but a CLL is newer useful for COLL, if your CLL preserves LL edge orientation then it is a COLL and should be listed as that. If your alg destroys M slice edges then it is a CMLL, if it ruins F2L edges it is a CF / 2x2x2 and if it changes FL corner premutation it is a EG 0/1 alg (all levles are also useful for [[Ortega]]).

== Beginner / Stepping stone ==
For a beginner who likes a stepping stone it is possible to do CxLL in two steps; first orientation and then permutation. In the navigator these algs are the grey cases having single letter names, orientations are in the leftmost row and permutations in the topmost line.

== Links: ==
* [http://www.speedsolving.com/forum/showthread.php?t=6365 Thread discussing this CxLL page]
* [http://www.speedsolving.com/forum/showthread.php?t=6497 Thread discussing 2x2x2 algorithms]
* [http://home.comcast.net/~quadricode/hyperorientations/ Hyperorientations]: A proposed method for recognizing C*LL cases easily.

==Navigator==
{{CxLLnav}}