I tried using gsf's solver for the puzzles in this thread (this point has been reached after several trial & error attempts)

the current rules can be emulated (save for a minor difference in point 8) using the following (windows cmd):

- Code: Select all
`-BG `

-q"FN;v_1=V"

-q"{FNB2B3H2T2T3H3H4W2W3}{W4}-G;v_2=V&&h2;h_2=h2;b_2=b2;i_2=i2"

-q"{FN}{W4}-G;v_3=V&&h2;h_3=h2;b_3=b2;i_3=i2"

-q"{FNB2B3H2T2T3H3H4W2W3X}{W4}-G;v_4=V&&h2;h_4=h2"

-f"%%v,%%(v_1?(v_2?(v_3?((b_2>b_3||b_2==b_3&&i_2>=i_3)?(S?(C1?((v_4&&h_4)?80:70):60):50):((b_2==b_3)?42:41)):30):20):10)x"

This has caused puzzle#daj95376-003 to score 4.2

& Puzzle#Mauricio-004 to score 80

the use of the -J otipn has identified these problems. however, incorporating them into the process so that a list of puzzles can be processed with a double-click to give you a list of puzzle with each individual score proved to be difficult.

I have therefore used the followingg set of options

- Code: Select all
`-BG `

-q"FN;v_1=V"

-q"{FNB2B3H2T2T3H3H4W2W3}{W4}-G;v_2=V&&h2;h_2=h2;b_2=b2;i_2=i2"

-q"{FN}{W4}-G;v_3=V&&h2;h_3=h2;b_3=b2;i_3=i2"

-q"{FNB2B3H2T2T3H3H4W2W3X}{W4}-G;v_4=V&&h2;h_4=h2"

-f"%%v,%%(Poster)f,%%(v_1?(v_2?(v_3?(S?(C1?((v_4&&h_4)?80:70):60):50):30):20):10)x"

which skips point 4 all together & run manually each puzzle that scores >=50 with EACH of the following

- Code: Select all
`-q"{[B]NF}{[S]W4}-G" -J -e"min(W4)+max(W4)+1" -f- -Ff"%%(min())x,%%(max())x"`

-q"{[B]NFBHTW2W3}{[S]W4}-G" -J -e"min(W4)+max(W4)+1" -f- -Ff"%%(min())x,%%(max())x"

The passes should have a similar minimum count.

If the FNW4 pass has a greater minimum then that puzzle would be demoted to score 40. For the 19 posted puzzles, this happened only to Puzzle#tarek-001 & Puzzle#Mauricio-004.

I can confirm that for the puzzles scoring >= 50, Only 1 Jellyfish is needed to solve except for Puzzle#tarek-006 which needs 2.

tarek