From xirion!jandr@relay.nl.net Tue Dec 21 02:45:28 1993 Return-Path: Received: from sun4nl.NL.net by life.ai.mit.edu (4.1/AI-4.10) for /com/archive/cube-lovers id AA24967; Tue, 21 Dec 93 02:45:28 EST Received: from xirion by sun4nl.NL.net via EUnet id AA28145 (5.65b/CWI-3.3); Tue, 21 Dec 1993 08:45:07 +0100 Received: by xirion.xirion.nl id AA00997 (5.61/UK-2.1); Tue, 21 Dec 93 08:43:59 +0100 From: Jan de Ruiter Date: Tue, 21 Dec 93 08:43:59 +0100 Message-Id: <997.9312210743@xirion.xirion.nl> X-Organization: Xirion Unix Software & Consultancy bv Burgemeester Verderlaan 15 X 3454 PE De Meern The Netherlands X-Phone: +31 3406 61990 X-Fax: +31 3406 61981 To: anandrao@hk.super.net, cube-lovers@ai.mit.edu Subject: Re: Rubiks tangle To: anandrao@hk.super.net Cc: cube-lovers@ai.mit.edu >Your concept is theoretically extendable to the 10*10 tangle, but even >with this optimisation the puzzle would take a long time to solve. How >long do you take for the 5*5 Tangle on your computer? I am sorry to say I haven't implemented the search yet. The 5x5 is solved, so that isn't that interesting anymore; the 10x10 has such a huge search space, that it will need a very efficient algorithm and/or clever representation. I just haven't decided on the representation yet. I did decide on the search order though. - Jan D. de Ruiter