The New Sudoku Players' Forum

[gsf]

forget about the fins --
how about adding (un-finned) Franken and Mutant fish ?

a major difficulty would be to find a spare letter

~ Pat

ha
this refers to my penchant for using single letters for the constraint methods
(and in a lot of my on the fly coding if you dig that deep)

is there a file (or small group of files) that catalogs fish taxonomy from basics to the bleeding edge?
I'd like to isolate any holes in the non-fish methods I've implemented
if there are I've got

Code: Select all

    /* 'A' reserved for almost locked sets      */
    /* 'L' unused                               */
    /* 'U' reserved for uniqueness              */
    /* 'Z' reserved for fish/fin zoology        */


[Pat]

is there a file (or small group of files) that catalogs fish taxonomy
from basics to the bleeding edge?

you may want ronk's catalogue

also see Pat (2007.Feb.19)

~ Pat

[Pat]

your manual says --

EXPRESSIONS

Expressions are C language style signed long expressions on constraint
counters. A constraint counter is named by the constraint identifier
(case insensitive) and one optional digit

actually: case-sensitive

e.g. H T W but not h t w

[gsf]

is there a file (or small group of files) that catalogs fish taxonomy
from basics to the bleeding edge?

you may want ronk's catalogue

also see Pat (2007.Feb.19)

thanks for the exemplar refs

[gsf]

your manual says --

EXPRESSIONS

Expressions are C language style signed long expressions on constraint
counters. A constraint counter is named by the constraint identifier
(case insensitive) and one optional digit

actually: case-sensitive

e.g. H T W but not h t w

thanks, at one time it was -- I elided (case insensitive) from the next release
now back to the program already in progress

[gsf]

you may want ronk's catalogue

also see Pat (2007.Feb.19)

thanks for the exemplar refs

re generating pencilmark examples from an exemplar
does the following capture the essence of the exemplars?

the exemplar characters are { . X * / # }
arbitrarily chose 1 to be the candidate value
initialize all cells to 123456789
set each / cell to 23456789 (eliminate the 1 candidate)
if # are present then generate two examples:
A: # cells unchanged
B: # cells set to 23456789

[ronk]

does the following capture the essence of the exemplars?

the exemplar characters are { . X * / # }
arbitrarily chose 1 to be the candidate value
initialize all cells to 123456789
set each / cell to 23456789 (eliminate the 1 candidate)
if # are present then generate two examples:
A: # cells unchanged
B: # cells set to 23456789

That sounds correct to me.

Indeed, I think that's exactly what daj95376 did when he verified the exemplars with a Templates technique. However, Templates would generally find more eliminations. This is especially true when one unfins a sashimi fish (your ex. B), because they often degenerate into cascading locked candidates.

[daj95376]

does the following capture the essence of the exemplars?

the exemplar characters are { . X * / # }
arbitrarily chose 1 to be the candidate value
initialize all cells to 123456789
set each / cell to 23456789 (eliminate the 1 candidate)
if # are present then generate two examples:
A: # cells unchanged
B: # cells set to 23456789

What you've described will work. I do it slightly different.

set all / and # cells to 12345678_ , set all other cells to 123456789

solve to find most eliminations possible

one at a time, replace original # cells with 123456789 and solve for ** cells specifically for it

Now that I've written a (non-remote) generic fish finder (GFF), I may re-run the exemplars with it. This should eliminate the extraneous Template eliminations that ronk mentioned.

Note: I'm still trying to convince ronk that "*X" cells should be marked "*" -- or "**" if a fin cell is present.