Hi Heetbeet,
heetbeet wrote:Hi, I have a publication that is undergoing revision. For the publication I compare two techniques for solving constraint satisfaction problems (such as Sudoku).
Could you say a word about the two techniques, the main results and why you compare them only for the hardest instances?
heetbeet wrote:I made extensive use of Champagne's ph_1910.zip database for evaluation and comparing between the two techniques, and have referenced the database as:
- Code: Select all
@misc{champagne,
title={The hardest sudokus},
author={Champagne},
howpublished = {\url{http://forum.enjoysudoku.com/the-hardest-sudokus-new-thread-t6539.html} and \url{http://drive.google.com/drive/u/0/folders/0B5lH6mGXxWzXTDFRMnVTbGNlZU0}},
note = {Accessed: 2019-09-30},
year={2019}
}
The revision requires an improvement to the quality of the publication's references, namely "Google Drive links, and [...] hyperlinks in the references".
Does anyone (including Champagne) know how I can better reference this dataset? Are there any publications that uses/references this dataset, so I can at least cross reference the URL+GDrive with that publication?
First, I would delete the "Accessed" part.
Second, what they require about "quality" doesn't mean how the links are written. An URL is an URL and can only be written as an URL (in their selected format). The real problem is, scientific journals hate references to personal pages, Wikipedia, forums and other asocial networks. In the present case, you need to explain why you need to do it nevertheless (if you do need it; isn't the reference to the database itself enough?)
heetbeet wrote:Alternatively, how can I explain the need to use this database? My thinking is that this is the most difficult Sudoku database out there, and it would be silly to use something else. But how can I formally (or at least somewhat formally) state this, or state something close to this?
You're right and that's the easy part, e.g.: In the world of Sudoku, a small community has developed a large database of the hardest known 9x9 puzzles, according to the informal but widely accepted criterion of the Sudoku Explainer rating. The results of this unique collaborative research work, spanning more than a decade, are available on (and only on)
http://drive.google.com/drive/u/0/folde ... nVTbGNlZU0 [put this in the required format].
But what you must also explain is why you need to consider the hardest instances in your comparisons, instead of an unbiased sample. Also be aware that this is a very biased database, even among the hardest puzzles, due to the way it was elaborated (largely by ±2 neighbourhood search).
If you need to justify using the SER as the measure of "hardness", you can refer to its very good correlation with pure logic ratings, such as B (or BpB for the hardest instances).