Hi all,
Freecell Solver 3.14.0 was released and can be downloaded from its homepage at
http://fc-solve.shlomifish.org/ . Freecell Solver is a reusable and
open-source (MIT/X11-licensed) library, written in portable C99 with some
GCCisms (32-bit/64-bit, UNIX/Linux and MS Windows), that can automatically
solve the Solitaire game Freecell and some similar Solitaire variants.
The Freecell Solver distribution also includes some standalone command-line
programs that make use of the library. Freecell Solver has a very large amount
of features, supports many different run-time heuristics that may yield
different solutions, is a fast solver, and supports the largest number of
Solitaire variants of all other solvers of its kind.
The new release features a preset that yields solutions faster on average
("amateur-star"), a preset which yields shorter solutions ("micro-finance")
more configurability, new features, bug fixes and other improvements. is the
list of major changes since the previous stable release, 3.12.0, from the
NEWS.txt file:
[QUOTE]
Version 3.14.0: (31-Oct-2012)
-----------------------------
1. Got the tests to pass with +cmake -DFCS_WITHOUT_DEPTH_FIELD=1+ by making
the library behave the same as without it. This also affected the behaviour of
+./fc-solve -l mo+ with attempting to solve Baker’s Dozen deals.
2. On UNIX platforms, +fc-solve+ now exits gracefully with the message
“Iterations count exceeded.”, upon receiving a SIGABRT signal. Can be
triggered by executing +pkill -ABRT fc-solve+.
3. The game states’ input routines now accept regular columns that start with
a leading colon (":"). As a result, one can input the states as output from
the solver with the +-p+ and +-t+ flags directly there.
4. Added a 6th BeFS weight (see the +-asw+ flag) of the inverse of the number
of cards not above parents. Using
+./freecell-solver-range-parallel-solve 1 32000 1 -p -t -sam --method a-star
-to 0123467589 -asw 1,0,0,0,0,1 -sp r:tf -mi 100000+ appears to be interesting.
5. Allow test groups inside the +-to+ and +-dto+ flags to be ordered using
the +=asw(…)+ function and its parameters, based on the BeFS (Best-first
search) weights calculation.
6. Added the +-l amateur-star+ (or +-l as+ for short) preset, based on the
+=asw(…)+ ordering that is the fastest preset yet.
7. Added the +-l micro-finance+ (or +-l mf+ for short) preset, based on the
6th BeFS weight.
8. Implement a Prune for games whose columns cannot be filled by any card
(such as Baker’s Dozen), where moving the last card on a column to a
different column is pointless. For more information, see
http://tech.groups.yahoo.com/group/fc-solve-discuss/message/1121 .
9. In +dbm_fc_solver+ and +depth_dbm_fc_solver+, implement the “DeBondt”
encoding method for Freecell and Baker’s Dozen, which allows for an even more
compact representation of the encoded states.
10. The libfreecell-solver code is now 64-bit-enabled and many of the limits
were converted to allow for 64-bit systems.
11. Dropped support for Microsoft Visual C++ (+CL.EXE+) and other compilers
that don't support C99/gnu99.
12. Add +scripts/convert-dbm-fc-solver-solution-to-fc-solve-solution.pl+
to convert a solution output of the dbm_fc_solver to one compatible with
fc-solve.
[/QUOTE]
I hope to prepare a binary distribution of it for Win32 soon.
Regards,
Shlomi Fish
--
-----------------------------------------------------------------
Shlomi Fish http://www.shlomifish.org/
The Case for File Swapping - http://shlom.in/file-swap
Better be a tail for the lions, than the head of the jackals.
— Pirkei Avot, 4 15
Please reply to list if it's a mailing list post - http://shlom.in/reply .
Received on Wed Oct 31 2012 - 07:06:58 IST