Path: utzoo!attcan!uunet!portal!cup.portal.com!phorgan
From: phorgan@cup.portal.com (Patrick John Horgan)
Newsgroups: comp.graphics
Subject: Re: Rubiks Cube
Message-ID: <24647@cup.portal.com>
Date: 2 Dec 89 06:35:59 GMT
References: <256@<4382> <207400039@s.cs.uiuc.edu> <17537@netnews.upenn.edu>
Organization: The Portal System (TM)
Lines: 10


	Maybe I'm missing something, but isn't this just a search?
I mean, a depth first search with backtracking would rapidly find
a solution...Perhaps not with the fewest moves though...for that
use a bredth-first with pruning of branches that are already over
our best progress yet...Throw in some appropriate heuristics...I
believe some of the "solution books" would be a good source for
these...to prune off obvious bad paths, and there you go!

Patrick - Rather code than play with a cube - Horgan


Brought to you by Super Global Mega Corp .com