From anandrao@hk.super.net  Thu Dec 16 01:19:38 1993
Return-Path: <anandrao@hk.super.net>
Received: from hk.super.net by life.ai.mit.edu (4.1/AI-4.10) for /com/archive/cube-lovers id AA29860; Thu, 16 Dec 93 01:19:38 EST
Received: by hk.super.net id AA09218
  (5.65c/IDA-1.4.4 for cube-lovers@ai.mit.edu); Thu, 16 Dec 1993 14:19:24 +0800
Date: Thu, 16 Dec 1993 14:12:56 +0800 (HKT)
From: Mr Anand Rao <anandrao@hk.super.net>
Subject: Re: Description of Tangle, Part 2
To: Don Woods <Don.Woods@eng.sun.com>
Cc: cube-lovers@ai.mit.edu
In-Reply-To: <9312160139.AA26306@colossal.Eng.Sun.COM>
Message-Id: <Pine.3.07.9312161456.C8422-a100000@hk.super.net>
Mime-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII

> 
> I've modified my program to try the 10x10, but indeed, it's taking a long
> time.  (Current estimate is it will take over a year to finish.)  I suspect
> that fact that pieces aren't "used up" as fast -- i.e., since there's at
> least four of any given piece, there will usually be at least one of whatever
> you're looking for for quite a ways down the search tree -- makes this
> approach intractible.
> 
 True. The 5*5 puzzle search truncates much faster because you run out of
pieces that could fit into a specific slot. The same does not apply to the
10*10 one.
Has anyone tried to solve the 10*10 for just 1 colour. That leaves you
with only 4 tile types with 24,25 or 26 of each type. The solution may
give some indication of the resultant pattern of the selected colour. If
there aren't too many solutions, maybe we can build the 4 colour solution
from this my permuting and rotating thr tiles. Any idea on how this will work?