From cube-lovers-errors@oolong.camellia.org Wed Jun 11 20:44:06 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 UAA15754; Wed, 11 Jun 1997 20:44:06 -0400 Precedence: bulk Errors-To: cube-lovers-errors@oolong.camellia.org From: SCHMIDTG@iccgcc.cle.ab.com Date: Wed, 11 Jun 1997 20:42:11 -0400 (EDT) To: cube-lovers@ai.mit.edu Message-Id: <970611204211.2141971d@iccgcc.cle.ab.com> Subject: Re: Detailed explanation of two phase algorithm Herber Kociemba wrote: [...much additional detailed explanation deleted...] Thank again, I found this information helpful, especially when my only other option is to examine code in great detail in order to extract out the general principles. >> I will be interested in looking at your new program when it becomes >> available. > >I'm writing too much to this mailing list and do not work at my >windows-help! Sorry about that. I'll stop with my questions. In fact, no need to even answer this response! I'm sure your program will be well worth the wait :). > The program itself is ready. I did a two hours run on each >of Rich Korfs 10 random cubes on a Pentium133 with 16MB RAM and the >result were really pleasing: The generated maneuver lenghts were on the >average less than 1 move away from Rich Korfs optimal solutions >(exactly: 9 moves more for the 10 cubes). Very impressive. And if you perform some longer runs and find optimal solutions, please be sure to let us know the run times. Best regards, -- Greg