From: "Stijn Helsen" <>
Newsgroups: comp.soft-sys.matlab
Subject: Re: 2 Algorithm enhancements and Theoretical Limits
Message-ID: <eeefd44.107@webx.raydaftYaTP>
Date: Wed, 10 Nov 2004 14:54:59 -0500
References: <eeefd44.93@webx.raydaftYaTP> <eeefd44.94@webx.raydaftYaTP> <eeefd44.95@webx.raydaftYaTP> <> <>
Lines: 11
MIME-Version: 1.0
Content-Type: text/plain; charset="ISO-8859-1"
Content-Transfer-Encoding: 8bit
Xref: comp.soft-sys.matlab:240910

I don't think that the path-searching is the most difficult part in
this problem. Especially because the the cost for one path (move of
one block) is simply the distance. The problem is more the
combination of the paths of all the blocks that is giving the biggest
For many situation the path for some blocks is from point A to point
A, just to make room for other blocks. And then which block has to
go away when during the paths of the other blocks.
So, the theory given here is nice, but is only a small part of it.