tdillon wrote:Sorry for wasting time ... I guess I've misunderstood the requirements for canonicalization.
I wasn't sure what form is used for the puzzles in ph_1910.zip, but I was under the incorrect impression that fsss2 --solrowminlex produces a canonical form. So I solrowminlex'd the puzzles in 01_file1.txt, and the "new" puzzles, and checked for any overlap. (actually I didn't recheck this after adding the last puzzle, and I see there *is* overlap for this one).
What tool produces the canonical form you use?
For specific reasons, I use a "max lexical form", but the code is derived from the old gsf's min lexical code. as far as I remember, this code in used in gridchecker in the original form.
Using any "valid' canonical form works. If you don't have it, I can load somewhere the original code from gsf (C++ license as below)
- Code: Select all
* This software is part of the ast package *
* Copyright (c) 2005-2009 AT&T Intellectual Property *
* and is licensed under the *
* Common Public License, Version 1.0 *
* by AT&T Intellectual Property *
What I do to keep the original code and avoid redundancy is the following :
I add the canonical form to the puzzle
I load both in a data base, checking for redundancy on the canonical form