Extra Superior

Everything about Sudoku that doesn't fit in one of the other sections

Re: re(2): _equivalent_ fish

Postby gsf » Mon Sep 10, 2007 1:58 am

Pat wrote: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        */
Last edited by gsf on Mon Sep 10, 2007 10:24 am, edited 1 time in total.
gsf
2014 Supporter
 
Posts: 7306
Joined: 21 September 2005
Location: NJ USA

re: fish catalogue

Postby Pat » Mon Sep 10, 2007 2:04 pm

gsf wrote: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
User avatar
Pat
 
Posts: 3627
Joined: 18 July 2005

case-sensitive

Postby Pat » Mon Sep 10, 2007 3:11 pm

off-topic wrote: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
User avatar
Pat
 
Posts: 3627
Joined: 18 July 2005

Re: re: fish catalogue

Postby gsf » Mon Sep 10, 2007 4:17 pm

Pat wrote:
gsf wrote: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

thanks for the exemplar refs
gsf
2014 Supporter
 
Posts: 7306
Joined: 21 September 2005
Location: NJ USA

Re: case-sensitive

Postby gsf » Mon Sep 10, 2007 4:26 pm

Pat wrote:
off-topic wrote: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
2014 Supporter
 
Posts: 7306
Joined: 21 September 2005
Location: NJ USA

Re: re: fish catalogue

Postby gsf » Tue Sep 11, 2007 1:37 pm

gsf wrote:
Pat wrote:you may want ronk's catalogue

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
gsf
2014 Supporter
 
Posts: 7306
Joined: 21 September 2005
Location: NJ USA

Re: re: fish catalogue

Postby ronk » Tue Sep 11, 2007 2:51 pm

gsf wrote: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.
ronk
2012 Supporter
 
Posts: 4764
Joined: 02 November 2005
Location: Southeastern USA

Re: re: fish catalogue

Postby daj95376 » Tue Sep 11, 2007 3:01 pm

gsf wrote: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.
daj95376
2014 Supporter
 
Posts: 2624
Joined: 15 May 2006

Previous

Return to General