On Tue, 2 Sep 2003, Danny A Jones wrote:
> My wording lacked clarity. I'm sorry.
>
> I should have probably defined "difficult" as requiring 20% more moves
> for a solution than a median/"typical" problem.
>
> For example, in problems 1-500, some deals require only 28 moves to
> solve; whereas others require 58 moves. The median is 41 moves. Problems
> requiring 49 moves or more are what interest me. (These numbers are
> subjective, but should still give reasonable insight into my objectives.)
>
Do you mean the number of moves that the solver emits as a solution? Or
the minimal number of moves required to solve the board?
If the former, then the following script should do:
#!/bin/sh
first_game=32001
last_game=32100
moves_num=150
for I in `seq $first_game $last_game` ; do
m="`pi-make-microsoft-freecell-board $I |
fc-solve -l good-intentions |
grep ====== |
wc -l`"
if test $m -gt $moves_num ; then
echo $I
fi
done
It's a UNIX script which has to be adapted to Windows NT.
If you wish to find the length of the optimal solution, then Freecell
Solver can't help you much because it cannot do this yet. Patsolve can,
however, only it uses atomic (one-card) moves, which may or may not be
what you are looking for.
Regards,
Shlomi Fish
> WKRfresno_at_aol.com wrote:
>
> > How would a computer decide whether a deal is difficult?
> > Bill Raymond
>
>
>
>
> To unsubscribe from this group, send an email to:
> fc-solve-discuss-unsubscribe_at_yahoogroups.com
>
>
>
> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/
>
>
----------------------------------------------------------------------
Shlomi Fish shlomif_at_t2.technion.ac.il
Home Page:
http://t2.technion.ac.il/~shlomif/
There's no point in keeping an idea to yourself since there's a 10 to 1
chance that somebody already has it and will share it before you.
Received on Wed Sep 03 2003 - 11:46:05 IDT