Thistlethwaite's Algorithm

Thistlethwaite's Algorithm
An algorithm devised by in 1981 for solving the Rubiks Cube.

Wikipedia foundation.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Morwen Thistlethwaite — Nationality  British Fields …   Wikipedia

  • Optimal solutions for Rubik's Cube — Computer Graphics of a scrambled Rubik s cube There are many algorithms to solve scrambled Rubik s Cubes. The maximum number of face turns needed to solve any instance of the Rubik s cube is 20.[1] This number is also known as the diameter of the …   Wikipedia

  • Coset — In mathematics, if G is a group, and H is a subgroup of G, and g is an element of G, then gH = {gh : h an element of H } is a left coset of H in G, and Hg = {hg : h an element of H } is a right coset of H in G. Only when H is normal… …   Wikipedia

  • Alternating knot — In knot theory, a link diagram is alternating if the crossings alternate under, over, under, over, as you travel along each component of the link. A link is alternating if it has an alternating diagram.Many of the knots with crossing number less… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”