From cube-lovers-errors@oolong.camellia.org Fri Jun 6 01:56:45 1997 Return-Path: cube-lovers-errors@oolong.camellia.org Received: from oolong.camellia.org (localhost [127.0.0.1]) by oolong.camellia.org (8.6.12/8.6.12) with SMTP id BAA09522; Fri, 6 Jun 1997 01:56:45 -0400 Precedence: bulk Errors-To: cube-lovers-errors@oolong.camellia.org Message-ID: <33974835.29FE@hrz1.hrz.th-darmstadt.de> Date: Fri, 06 Jun 1997 01:13:57 +0200 From: Herbert Kociemba X-Mailer: Mozilla 3.0 (Win95; I) MIME-Version: 1.0 To: cube-lovers@ai.mit.edu, Jerry Bryan Subject: Re: More on Korf's method References: Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Jerry Bryan wrote: > Is this correct -- that is, does > the Kociemba algorithm guarantee us an optimal solution only after the > solution is derived entirely in phase1? It's like you supposed. I see no way, how to *guarantee* an optimal solution before that, though in many cases you *find* an optimal solution much earlier. You may have more than one minimum maneuver, and the chance is good, that one of these maneuvers has a tail with maneuvers only out of . Herbert