Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!clyde!uunet!tut.cis.ohio-state.edu!usenet.ins.cwru.edu!mephisto!prism!fsu!geomag!prem
From: prem@geomag.fsu.edu (Prem Subrahmanyam)
Newsgroups: comp.graphics
Subject: Re: Factoring Rubik's Cube
Message-ID: <391@fsu.scri.fsu.edu>
Date: 5 Dec 89 19:09:44 GMT
References: <UZR7nQC00htFQwWno4@cs.cmu.edu> <11390025@hpldola.HP.COM>
Sender: news@fsu.scri.fsu.edu
Reply-To: prem@geomag.UUCP (Prem Subrahmanyam)
Organization: Florida State University Computing Center
Lines: 9


   I would STRONGLY suggest using one of the solutions to Rubik's Cube
   books.  There was at least one that presents a concise algorithm for
   solving the cube depending on its initial state, with a few branches
   here and there depending on results from previous moves.  The one
   I'm referring to (I can't remember the title) was written independent
   of the color-coding scheme of the faces, thus it was independent of
   the "brand" of cube you were solving.  
   ---Prem Subrahmanyam