On Sat, 13 Oct 2012 12:48:10 -0700
"Gary Campbell" <gary_at_numin8r.us> wrote:
> Has anyone actually followed this solution?
>
> As a "near intractable" I thought it might be a good study, but
> this solution is "bloody awful!"
>
Well, I've now tried it with patsolve:
1. With ./patsolve -f -S -M100 -N94717719 94717720 I am getting a 684 moves-long
solution.
2. ./patsolve -f -M1000 -N94717719 94717720 runs out of memory.
I can now try to iterate on my random-dfs scans in order to minimise the solution.
That or maybe the Best-first-search scan will work.
Regards,
Shlomi Fish
> I'll try to work out an alternative that might be useful to someone.
> If someone else gets to it first, please post. This could take a few
> hours!
>
> -Gary Campbell
>
> > #94717719 Attempt: 1 NumFcs=4 (WKR+ Super) 0 moves Intractable
> >
> > Regards, Danny
> >
>
> It is solvable. Here is the "toons-for-twenty-somethings" solution:
>
> Regards,
>
> Shlomi Fish
--
-----------------------------------------------------------------
Shlomi Fish http://www.shlomifish.org/
List of Portability Libraries - http://shlom.in/port-libs
When Chuck Norris uses Gentoo, “emerge kde” finishes in under a minute. A
computer cannot afford to keep Chuck waiting for too long.
Please reply to list if it's a mailing list post - http://shlom.in/reply .
Received on Sat Oct 13 2012 - 14:28:37 IST