Hi Danny,
On Tue, 02 Oct 2012 00:13:36 -0000
"dannyjones183" <dannyjones183_at_yahoo.com> wrote:
> Here's my understanding of 8x4 FreeCell deals:
>
For the record, 8x4 Freecell deals (to avoid our own jargon) are standard Freecell
layouts, with 4 initial freecells - all of which are empty. The deals we refer
to are the ones in
http://en.wikipedia.org/wiki/FreeCell_%28Windows%29 - see
http://rosettacode.org/wiki/Deal_cards_for_FreeCell .
> * After a recent determination of deals #24,795,893 and #53,687,601 as
> unsolveable, the solveability of the first 100,000,000 deals have been
> determined.
Would you care to share the list of impossible/unsolveable deals?
> * For the first 25,000,000 deals, I've been able to solve all but
> three of the solveable deals in less than 60 moves.
OK. There has been some research which showed that generalised Freecell
is NP-complete (as a function of the number of ranks), see:
http://en.wikipedia.org/wiki/FreeCell#Complexity
This may set a hard limit to the number of minimal moves.
BTW, by "less than 60 moves", do you mean "59 or less" or
do you mean "60 or less"?
>
> * For the first 1,000,000 deals, a wesite exists with short solutions
> for every solveable deal. Unfortunately, accessing those solutions
> are a pain IMO.
>
I think the accessibility of that site's solutions is very bad too.
> So, where do we go from here???
>
Have you verified that all these solutions of your are minimal? What do
you want to do further down the road?
I have indirect access to High Performance Computing (HPC) machines with
128 GB of RAM (which works reliably) and with 512 GB of RAM (which does not
work very reliably), and can run my solvers (or solvers that are built
from other supplied sources) there. Would that help you somehow?
Regards,
Shlomi Fish
> Regards, Danny A. Jones
>
>
> #09189909 Attempt: 1 NumFcs=4 (BFS2 Super) 61 moves
> 7a 7b 72 7c 74 64 7d b7 d7 6b
> 6d 62 c2 42 1c 16 a1 4a 46 41
> 43 74 c3 7c d7 8d 82 87 86 84
> 51 35 34 a3 c8 48 58 4a 47 43
> 73 d4 24 2c 27 28 17 6h 1h bh
> 68 6b c6 16 15 15 36 51 3c 34
> 3d
> ~~~~~ (shorter solution possible?)
>
> #09559005 Attempt: 1 NumFcs=4 (BFS2 Super) 63 moves
> 31 56 3a 3b 3c 3d 35 b5 4b 34
> 84 a3 8a 83 c3 8c 85 a5 2a 82
> b2 d8 6b 6d 62 68 d6 b6 48 64
> 24 6b 6d b6 d6 26 24 2b 2d 23
> 27 c2 32 37 d3 63 43 52 b5 76
> 7b 73 13 1c 16 7d 76 56 51 15
> 45 4c 42
> ~~~~~ (shorter solution possible?)
>
> #24515390 Attempt: 1 NumFcs=4 (BFS0 Super) 66 moves
> 28 3a 6b 36 31 3c 38 3d 35 43
> 46 48 43 48 26 d4 7d 7h 73 c3
> 7c b7 47 63 83 34 3h 6b 63 d3
> 43 4d a4 2a 24 26 c2 62 8c b6
> 8b 87 87 82 b8 62 78 76 86 87
> 67 6b 6h c6 36 3h 63 16 1c 14
> 54 18 14 16 74 54
> ~~~~~
>
I can try running those on the depth_dbm_fc_solver.
Regards,
Shlomi Fish
--
-----------------------------------------------------------------
Shlomi Fish http://www.shlomifish.org/
First stop for Perl beginners - http://perl-begin.org/
CPAN thrives *because* of the unfettered uploading of shit, not in spite of it.
— Andy Lester
Please reply to list if it's a mailing list post - http://shlom.in/reply .
Received on Tue Oct 02 2012 - 01:53:22 IST